16 citations · 20 across the 11 of their papers we have counts for
3 papers · 1 filter
Cycle-factors of regular graphs via entropy
Micha Christoph, Nemanja Draganić, António Girão +3
It is a classical result that a random permutation of elements has, on average, about cycles. We generalise this fact to all directed -regular graphs on vertice…
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)…
Asymmetric results about graph homomorphisms
Lior Gishboliner, Eoin Hurley, Yuval Wigderson
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph has certain properties, then it has a homomorphism to a triangle-free gra…