Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
In balanced bipartite Dirac graphs, the hitting time for min-degree 2 equals the hitting time for Hamiltonicity whp, extending Bollobás-Kohayakawa and giving a bipartite analogue of Johansson's theorem.
citing papers explorer
-
Dirac subgraphs of powers of cycles are Hamiltonian
Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
-
On the hitting time of Hamiltonicity in bipartite Dirac graphs
In balanced bipartite Dirac graphs, the hitting time for min-degree 2 equals the hitting time for Hamiltonicity whp, extending Bollobás-Kohayakawa and giving a bipartite analogue of Johansson's theorem.