arXiv (All)
open access
An independent computer-assisted proof of the Chen-Raspaud conjecture for k=4
We give an independent computer-assisted proof of the k=4 case of the Chen-Raspaud conjecture. We prove that every graph G with odd-girth(G) >= 9 and mad(G) < 9/4 admits a homomorphism to the Kneser graph K(9,4). The proof combines a minimal-counterexample argument with a rooted star replacement, ex
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
- Resolving Pisanski's Conjecture#1297437
- Periodic efficient total girth colorings in cubic maps of girth 4 correspond to 3-permutation face colorings#1130180
- Exact and extremal values of chromatic villainy#1297932
- The biwheel conjecture for braces#1297307
- Towards a Sum-of-Squares Proof for the Nonexistence of Conway's 99-graph#1327856
Record · ID 1217703
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