Nemanja Draganić

activity

20172026

most citedSize-Ramsey numbers of graphs with maximum degree three

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

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

The largest hole in sparse random graphs

Nemanja Draganić, Stefan Glock, Michael Krivelevich

We show that for any $d = d (n)$ with $d_{0} (ε) \leq d = o (n)$ , with high probability, the size of a largest induced cycle in the random graph $G (n, d / n)$ is $(2 \pm ε) \frac{n}{d} lo g d$ . T…

math.CO2021

Tight bound for powers of Hamilton cycles in tournaments

Nemanja Draganić, David Munhá Correia, Benny Sudakov

A basic result in graph theory says that any $n$ -vertex tournament with in- and out-degrees larger than $\frac{n - 2}{4}$ contains a Hamilton cycle, and this is tight. In 1990, Bollo…