3 papers
math.CO2020
Colour-biased Hamilton cycles in random graphs
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
We prove that a random graph , with above the Hamiltonicity threshold, is typically such that for any -colouring of its edges there exists a Hamilton cycle with at l…
math.PR2019
The diameter of uniform spanning trees in high dimensions
Peleg Michaeli, Asaf Nachmias, Matan Shalev
We show that the diameter of a uniformly drawn spanning tree of a connected graph on vertices which satisfies certain high-dimensionality conditions typically grows like $Θ(\sq…
math.CO2019
Thresholds in random motif graphs
Michael Anastos, Peleg Michaeli, Samantha Petti
We introduce a natural generalization of the Erdős-Rényi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H…