5 citations · 9 across the 19 of their papers we have counts for
5 papers · 1 filter
On Independent Spanning Trees in Random and Pseudorandom Graphs
Nemanja Draganić, Keith Frankston, Michael Krivelevich +2
In 1989, Zehavi and Itai conjectured that every -connected graph contains independent spanning trees rooted at any prescribed vertex . That is, for each vertex , the u…
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…
New bounds for linear arboricity and related problems
Micha Christoph, Nemanja Draganić, António Girão +3
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree can be decomposed into at most $\lceil(Δ+1)…
Cyclic subsets in regular Dirac graphs
Nemanja Draganić, Peter Keevash, Alp Müyesser
In 1996, in his last paper, Erdős asked the following question that he formulated together with Faudree: is there a positive such that any -regular graph on ver…
Pósa rotation through a random permutation
Nemanja Draganić, Peter Keevash
What minimum degree of a graph on vertices guarantees that the union of and a random -factor (or permutation) is with high probability Hamiltonian? Girão and Espuny…