arXiv (All)
open access
A Chvátal-type codegree condition for Hamiltonian cycles in $k$-uniform hypergraphs
We prove an asymptotic Chvátal-type codegree criterion for tight Hamiltonian cycles in $k$-uniform hypergraphs for every fixed $k\ge3$. The criterion allows small degrees to be compensated by large degrees in the link graphs of $(k-2)$-tuples. It strengthens the asymptotic Dirac-type theorem by Rödl
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
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#924635
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#920403
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- Bounds for B-coloring planar and outerplanar graphs#818487
Record · ID 985948
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