Open Research Index

The hitting time for loose Hamilton cycles in r-graphs

Jared León

Palomar Registrypalomar/PALOMAR-2026-10-03-000003Oct 3, 2026math.COscore 0

A Lean formalisation of a hitting time theorem of Wanfang Chen, Jared León and Xizhi Liu. For every fixed integer r ≥ 3, assume all r-element subsets of n vertices are exposed in a uniformly random order. As n tends to infinity through multiples of r − 1, with probability tending to one, a loose Hamilton cycle first emerges exactly when the last isolated vertex disappears.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-10-03-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-03-000003/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-03-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'