A hitting-time version of Kotzig's conjecture in random graphs
math.CO
Submitted: 2026-11-01
Updated: 2026-11-01
Comments: 24 pages, 4 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- The perfect 1-factorisation conjecture holds asymptotically
- Sharp thresholds, hitting times and the power of choice for random geometric graphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality