5 citations · 9 across the 19 of their papers we have counts for
5 papers · 1 filter
Edge-disjoint paths in expanders: online with removals
Nemanja Draganić, Rajko Nenadov
We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong -regular expander graph with vertices. In particular, we…
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…
Chvátal-Erdős condition for pancyclicity
Nemanja Draganić, David Munhá Correia, Benny Sudakov
An -vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices and it is pancyclic if it contains cycles of all lengths from up to . A celebrated…