1 citations · 2 across the 7 of their papers we have counts for
7 papers · 1 filter
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
Nemanja Draganić, Jaehoon Kim, Hyunwoo Lee +3
Dirac's classical theorem asserts that, for , any -vertex graph with minimum degree at least is Hamiltonian. Furthermore, if we additionally assume that such grap…
Hamiltonicity of expanders: optimal bounds and applications
Nemanja Draganić, Richard Montgomery, David Munhá Correia +2
An -vertex graph is a -expander if for every with and there is an edge between every two disjoint sets of at least …
Optimal Hamilton covers and linear arboricity for random graphs
Nemanja Draganić, Stefan Glock, David Munhá Correia +1
In his seminal 1976 paper, Pósa showed that for all , the binomial random graph is with high probability Hamiltonian. This leads to the following natural…
Size-Ramsey numbers of structurally sparse graphs
Nemanja Draganić, Marc Kaufmann, David Munhá Correia +2
Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau and Schelp in 1978. Research has mainly…
A generalization of Bondy's pancyclicity theorem
Nemanja Draganić, David Munhá Correia, Benny Sudakov
The bipartite independence number of a graph , denoted as , is the minimal number such that there exist positive integers and with with the pro…
Turán problems in pseudorandom graphs
Xizhi Liu, Dhruv Mubayi, David Munhá Correia
Given a graph , we consider the problem of determining the densest possible pseudorandom graph that contains no copy of . We provide an embedding procedure that improves a ge…
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 -vertex tournament with in- and out-degrees larger than contains a Hamilton cycle, and this is tight. In 1990, Bollo…