1 citations · 1 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
New tools for sparse graph embeddings: Hybrid expanders and application to nested cycles
Nemanja Draganić
We introduce \emph{hybrid expanders}, sparse graphs which combine sublinear expansion across all scales with strong constant-factor expansion on smaller, polylogarithmic sets. We s…
math.CO2026
Efficient Hamilton covers and linear arboricity of random graphs
Nemanja Draganić, Michael Krivelevich
A Hamilton cover of a graph is a collection of Hamilton cycles whose union contains all edges. Since each Hamilton cycle covers two edges at every vertex, every Hamilton cover has…