7 citations · 26 across the 38 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
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…
math.CO2025
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)…