2 citations · 7 across the 7 of their papers we have counts for
5 papers · 1 filter
On Komlós' tiling theorem in random graphs
Rajko Nenadov, Nemanja Škorić
Conlon, Gowers, Samotij, and Schacht showed that for a given graph and a constant , there exists such that if then asymptotically almost su…
A general lower bound for collaborative tree exploration
Yann Disser, Frank Mousset, Andreas Noever +2
We consider collaborative graph exploration with a set of agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other ver…
Symmetric and asymmetric Ramsey properties in random hypergraphs
Luca Gugelmann, Rajko Nenadov, Yury Person +3
A celebrated result of Rödl and Ruciński states that for every graph , which is not a forest of stars and paths of length , and fixed number of colours there exist p…
A tight Erdős-Pósa function for long cycles
Frank Mousset, Andreas Noever, Nemanja Škorić +1
A classic result of Erdős and Pósa says that any graph contains either vertex-disjoint cycles or can be made acyclic by deleting at most vertices. Here we general…
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
Rajko Nenadov, Nemanja Škorić
We show that for every there exists such that if then asymptotically almost surely the random graph contains the \t…