On the hitting time of Hamiltonicity in bipartite Dirac graphs
arXiv:2606.11992
Abstract
Let and let be a balanced bipartite graph on vertices with minimum degree at least . Then, whp, the hitting time for minimum degree 2 coincides with the hitting time for Hamiltonicity. This extends Bollobás--Kohayakawa and gives a bipartite analogue of Johansson's theorem. As an immediate corollary, we deduce a sharp threshold result for Hamiltonicity in such graphs.