arXiv (All)
open access
A Counterexample to Wormald's Conjecture
We give a counterexample to Wormald's conjecture. A 16-vertex cubic graph, the disjoint union of $K_{3,3}$ with a 10-vertex bridged graph built from two subdivided copies of $K_4$, has no partition of its edges into two isomorphic spanning linear forests. The obstruction is parity: any such partitio
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
- Perfect matching covers of claw-free cubic graphs#1156072
- A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth#1077223
- Decomposing complete multipartite graphs into closed trails of arbitrary even lengths#955096
- Induced subgraphs and tree decompositions XIX. Thetas and forests#927134
- Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth#677074
Record · ID 1154709
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