Subgraph criterion for minimal doubled 3-regular graphs
Let be a doubled 3-regular graph. Perform the YY- transformation on all wyes in all possible ways to obtain a graph of smallest size. A chain of 3-cycles is a chain of one or more 3-cycles, each connected by a vertex that is also doubly adjacent to one more vertex, with the 3-cycles at either end having one vertex with exactly 4 neighbours and no connections of size greater than 2.
Minimality criterion conjecture. The graph is a minimal graph if and only if it does not contain such a chain of 3-cycles.
The conjecture proposes that, for doubled 3-regular graphs, checking the more restricted subgraphs illustrated in the first column of the paper's figure suffices to determine minimality. The source gives examples and discusses related reducible subgraphs, but provides no proof or resolution.
References
- Shannon Jeffries and Karen Yeats, “A degree preserving delta wye transformation with applications to 6-regular graphs and Feynman periods”, arXiv:2110.07764 (2022).
Progress summary
A reader-submitted counterexample claims the conjecture is false, but no independent source has checked it.
Jeffries and Yeats proposed that, after reducing a doubled -regular graph by all possible - moves, minimality is equivalent to containing no chain of -cycles. Their paper dates the conjecture to 2022 and gives examples but no proof or disproof.
Known results
- Jeffries and Yeats (2022): described the criterion, related reducible subgraphs, and computational examples, without resolving the conjecture.
Community submission (unverified)
Posted November 7, 2026, a submission argues that an -vertex doubled simple cubic graph has a chain-free pure - minimum of order , while one such minimum can be reduced to order ; it presents this as a counterexample. The submission itself says the accompanying preprint is AI-assisted and not externally peer reviewed.
Current status (as of November 2026): The conjecture remains open in the verified record; a community submission claims a counterexample, but that claim is unverified.
Sources
Solutions 1
A chain-free pure YY-Delta minimum that is not minimal: a counterexample to Jeffries-Yeats Conjecture 5.1 (arXiv:2110.07764; Ann. Inst. H. Poincare D 11 (2024))See full solution
Result and scope. Jeffries-Yeats Conjecture 5.1 for doubled 3-regular graphs. False: an 18-vertex doubled simple cubic graph has pure YY-Delta minimum order 11 (25 labelled minima, all chain-free under the faithful illustrated reading), and the selected minimum reaches order 10 by seven moves, so it is not minimal.
Complete proof: A chain-free pure YY-Delta minimum that is not minimal: a counterexample to Jeffries-Yeats Conjecture 5.1 (arXiv:2110.07764; Ann. Inst. H. Poincare D 11 (2024)) · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.