R. Nenadov

activity

20092026

most citedOn the number of graphs without large cliques

14 citations · 52 across the 41 of their papers we have counts for

collaborators

Showing 2018Show all

5 papers · 1 filter

math.CO2018

Complete minors in graphs without sparse cuts

Michael Krivelevich, Rajko Nenadov

We show that if $G$ is a graph on $n$ vertices, with all degrees comparable to some $d = d (n)$ , and without a sparse cut, for a suitably chosen notion of sparseness, then it contai…

math.CO2018

Sprinkling a few random edges doubles the power

Rajko Nenadov, Miloš Trujić

A seminal result by Komlós, Sarközy, and Szemerédi states that if a graph $G$ with $n$ vertices has minimum degree at least $k n / (k + 1)$ , for some $k \in N$ and $n$ suffic…

math.CO2018★ 1 cited

Towards the Kohayakawa--Kreuter conjecture on asymmetric Ramsey properties

Frank Mousset, Rajko Nenadov, Wojciech Samotij

For fixed graphs $F_{1}, \dots, F_{r}$ , we prove an upper bound on the threshold function for the property that $G (n, p) \to (F_{1}, \dots, F_{r})$ . This establishes the $1$ -statement of a co…

math.CO2018★ 1 cited

On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem

Rajko Nenadov, Yanitsa Pehova

A seminal result of Hajnal and Szemerédi states that if a graph $G$ with $n$ vertices has minimum degree $δ (G) \geq (r - 1) n / r$ for some integer $r \geq 2$ , then $G$ contains a $K_{r}$ -f…

math.CO2018★ 13 cited

Triangle-factors in pseudorandom graphs

Rajko Nenadov

We show that if the second eigenvalue $λ$ of a $d$ -regular graph $G$ on $n \in 3 Z$ vertices is at most $ε d^{2} / (n lo g n)$ , for a small constant $\varepsilon > 0…