On the hitting time of Hamiltonicity in bipartite Dirac graphs
Abstract
Let ∈ (0,1/2] and let G be a balanced bipartite graph on 2n vertices with minimum degree at least (1/2 + )n. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.