Nemanja Škorić

1. A tight Erdős-Pósa function for long cycles
   2016/03/24 by Frank Mousset, Mousset, Frank, Andreas Noever +5 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithms and Data Compression #Limits and Structures in Graph Theory #math.CO
2. Almost-spanning universality in random graphs
   2015/03/18 by David Conlon, Asaf Ferber, Conlon, David +5 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO
3. Robust hamiltonicity of random directed graphs
   2014/10/08 by Asaf Ferber, Ferber, Asaf, Rajko Nenadov +7 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO