14 citations · 52 across the 41 of their papers we have counts for
4 papers · 1 filter
An O(n) time algorithm for finding Hamilton cycles with high probability
Rajko Nenadov, Angelika Steger, Pascal Su
We design a randomized algorithm that finds a Hamilton cycle in time with high probability in a random graph with edge probability . T…
Rolling backwards can move you forward: on embedding problems in sparse expanders
Nemanja Draganić, Michael Krivelevich, Rajko Nenadov
We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanc…
The size-Ramsey number of short subdivisions
Nemanja Draganić, Michael Krivelevich, Rajko Nenadov
The -size-Ramsey number of a graph is the smallest number of edges a graph can have, such that for every edge-coloring of with colors there exists…
The threshold bias of the clique-factor game
Anita Liebenau, Rajko Nenadov
Let be an integer and consider the following game on the complete graph for : Two players, Maker and Breaker, alternately claim previously uncla…