activity
20152026
most citedColour-biased Hamilton cycles in random graphs

7 citations · 14 across the 15 of their papers we have counts for

collaborators
Showing 2020Show all

3 papers · 1 filter

math.CO2020

Discrepancies of Spanning Trees and Hamilton Cycles

Lior Gishboliner, Michael Krivelevich, Peleg Michaeli

We study the multicolour discrepancy of spanning trees and Hamilton cycles in graphs. As our main result, we show that under very mild conditions, the -colour spanning-tree disc…

math.CO2020

Spanning trees at the connectivity threshold

Yahav Alon, Michael Krivelevich, Peleg Michaeli

We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.

math.CO2020★ 7 cited

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…