2 papers
math.CO2025
Approximate Itai-Zehavi conjecture for random graphs
Lawrence Hollom, Lyuben Lichev, Adva Mond +2
A famous conjecture by Itai and Zehavi states that, for every -vertex-connected graph and every vertex in , there are spanning trees of such that, for every v…
math.CO2025
Monotonicity and decompositions of random regular graphs
Lawrence Hollom, Lyuben Lichev, Adva Mond +2
In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameter…