14 citations · 52 across the 41 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 2 cited
Robust hamiltonicity of random directed graphs
Asaf Ferber, Rajko Nenadov, Andreas Noever +2
In his seminal paper from 1952 Dirac showed that the complete graph on vertices remains Hamiltonian even if we allow an adversary to remove edges tou…
math.CO2014
An algorithmic framework for obtaining lower bounds for random Ramsey problems
Rajko Nenadov, Yury Person, Nemanja Škorić +1
In this paper we introduce a general framework for proving lower bounds for various Ramsey type problems within random settings. The main idea is to view the problem from an algori…
math.CO2014
On the threshold for the Maker-Breaker -game
Rajko Nenadov, Angelika Steger, Miloš Stojaković
We study the Maker-Breaker -game played on the edge set of the random graph . In this game two players, Maker and Breaker, alternately claim unclaimed edges of $G_{n,p}…