N. Skoric

activity

20092020

most citedLocal resilience of an almost spanning

k

-cycle in random graphs

2 citations · 7 across the 7 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 1 cited

Monochromatic cycle covers in random graphs

Dániel Korándi, Frank Mousset, Rajko Nenadov +2

A classic result of Erdős, Gyárfás and Pyber states that for every coloring of the edges of $K_{n}$ with $r$ colors, there is a cover of its vertex set by at most $f(r) = O(r^2 \log…

math.CO2017★ 2 cited

Local resilience of an almost spanning $k$ -cycle in random graphs

Nemanja Škorić, Angelika Steger, Miloš Trujić

The famous Pósa-Seymour conjecture, confirmed in 1998 by Komlós, Sárközy, and Szemerédi, states that for any $k \geq 2$ , every graph on $n$ vertices with minimum degree $kn/(k + 1)…

math.CO2017

Smaller subgraphs of minimum degree k

Frank Mousset, Andreas Noever, Nemanja Škorić

In 1990 Erdős, Faudree, Rousseau and Schelp proved that for $k \geq 2$ , every graph with $n \geq k + 1$ vertices and $(k - 1) (n - k + 2) + (2 k - 2) + 1$ edges contains a subgraph of minimu…

Monochromatic cycle covers in random graphs

Local resilience of an almost spanning k-cycle in random graphs

Smaller subgraphs of minimum degree k

Local resilience of an almost spanning $k$ -cycle in random graphs