5 citations · 9 across the 19 of their papers we have counts for
5 papers · 1 filter
Unavoidable hypergraphs
M. Bucić, N. Draganić, B. Sudakov +1
The following very natural problem was raised by Chung and Erdős in the early 80's and has since been repeated a number of times. What is the minimum of the Turán number $\text{ex}…
A Note on Powers of Paths in Tournaments
Nemanja Draganić, David Munhá Correia, Benny Sudakov
In this note we show that every tournament on vertices contains the -th power of a directed path of length , which improves upon the recent bound of Scott and Ko…
Powers of paths in tournaments
Nemanja Draganić, François Dross, Jacob Fox +7
In this short note we prove that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…
Large induced trees in dense random graphs
Nemanja Draganić
Erdős and Palka initiated the study of the maximal size of induced trees in random graphs in 1983. They proved that for every fixed the size of a largest induced tree in $G…
Large induced matchings in random graphs
Oliver Cooley, Nemanja Draganić, Mihyun Kang +1
Given a large graph , does the binomial random graph contain a copy of as an induced subgraph with high probability? This classical question has been studied extens…