arXiv (All)
open access
The realization graph of every degree sequence has a Hamilton path
For a degree sequence $d$, the realization graph $\mathcal{G_F}(d)$ is the graph whose vertices are the labeled realizations of $d$, two of which are adjacent if they differ by a single $2$-switch. We prove that for every degree sequence $d$ and every realization $S$ of $d$, the graph $\mathcal{G_F}
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
- A Chvátal-type codegree condition for Hamiltonian cycles in $k$-uniform hypergraphs#985948
- Polynomial minimum degree stability for $3$-chromatic graphs#821899
- Homological invariants of Edge Ideals associated to powers of cycles#1011381
- Diophantine m-tuples of Triangular Numbers#780995
- Diophantine m-tuples of Triangular Numbers#779620
Record · ID 1051486
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