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 2021Show all

4 papers · 1 filter

math.CO2021

Probabilistic hypergraph containers

Rajko Nenadov

Given a $k$ -uniform hypergraph $H$ and sufficiently large $m ≫ m_{0} (H)$ , we show that an $m$ -element set $I \subseteq V (H)$ , chosen uniformly at rand…

math.CO2021

The size-Ramsey number of cubic graphs

David Conlon, Rajko Nenadov, Miloš Trujić

We show that the size-Ramsey number of any cubic graph with $n$ vertices is $O (n^{8/5})$ , improving a bound of $n^{5/3 + o (1)}$ due to Kohayakawa, Rödl, Schacht, and Szemerédi. The…

math.CO2021★ 2 cited

Small subsets without $k$ -term arithmetic progressions

Rajko Nenadov

Szemerédi's theorem implies that there are $2^{o (n)}$ subsets of $[n]$ which do not contain a $k$ -term arithmetic progression. A sparse analogue of this statement was obtained by B…

math.CO2021

A new proof of the KŁR conjecture

Rajko Nenadov

Estimating the probability that the Erdős-Rényi random graph $G (n, m)$ is $H$ -free, for a fixed graph $H$ , is one of the fundamental problems in random graph theory. If $m$ is such…

Probabilistic hypergraph containers

The size-Ramsey number of cubic graphs

Small subsets without k-term arithmetic progressions

A new proof of the KŁR conjecture

Small subsets without $k$ -term arithmetic progressions