arXiv (All)
open access
Almost Every Graph Is Reconstructible from Its Token Graphs
Let $F_k(G)$ denote the $k$-token graph of a finite graph $G$. The token graph reconstruction conjecture asks whether, for any $1\le k<|V(G)|$, $F_k(G)\cong F_k(H)$ implies $G\cong H$. This paper proves that the conjecture holds for almost every graph.
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
- Almost Every Graph Is Reconstructible from Its Token Graphs#809463
- Every graph with no $K_7^=$ minor is 6-colorable#1011483
- The Erd\H os-Sós conjecture in dense graphs#985287
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Partition universality for graphs of bounded degeneracy and degree#1122870
Record · ID 819459
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