42 citations · 132 across the 20 of their papers we have counts for
Showing 2014 · math.COShow all
3 papers · 2 filters
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
The game chromatic number of dense random graphs
Ralph Keusch, Angelika Steger
Suppose that two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get diffe…
math.CO2014★ 3 cited
Random directed graphs are robustly Hamiltonian
Dan Hefetz, Angelika Steger, Benny Sudakov
A classical theorem of Ghouila-Houri from 1960 asserts that every directed graph on vertices with minimum out-degree and in-degree at least contains a directed Hamilton c…