arXiv (All)
open access
Hitting time for loose Hamilton cycles in the random hypergraph process
The random hypergraph process starts with an empty hypergraph on $n$ vertices and adds a uniformly chosen missing edge at each step. For even $n$, we prove that, with high probability, a $3$-uniform loose Hamilton cycle appears when the last isolated vertex disappears. The approach developed here ad
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Breaking the $2^n$ barrier for directed hamiltonicity#1144029
- On Kotzig's conjecture in random graphs#1115484
- Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances#1341751
- Decremental Single-Source Reachability in Planar Digraphs#1234736
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
Record · ID 1414499
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive