arxiv: 2605.09475 · v1 · submitted 2026-05-10 · 🧮 math.CO

Recognition: 2 theorem links

· Lean Theorem

On 4-covers of cubic graphs with two adjacent odd circuits in a 2-factor

Edita M\'a\v{c}ajov\'a, J\'an Karab\'a\v{s}

Pith reviewed 2026-05-12 04:35 UTC · model grok-4.3

classification 🧮 math.CO

keywords cubic graphs2-factorodd circuitsperfect matchingsedge coveringAlon-Tarsi conjecturespokes

0 comments

The pith

Cubic graphs with a 2-factor of two odd circuits and three spokes in the complementary 1-factor admit a cover by four perfect matchings.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies cubic graphs whose 2-factor consists of exactly two odd circuits. The complementary 1-factor in these graphs contains precisely three spokes connecting the circuits along with any number of chords. The authors prove that the edges of such a graph G can be covered by four perfect matchings. This covering implies that G satisfies the 7/5-conjecture of Alon and Tarsi. A reader would care because the result identifies a structural class of cubic graphs for which the conjecture holds and may supply methods usable in wider cases.

Core claim

Let G be a cubic graph admitting a 2-factor consisting of exactly two odd circuits, and let the complementary 1-factor contain precisely three spokes. We show that four perfect matchings can cover G. As a consequence, G fulfils the 7/5-Conjecture of Alon and Tarsi.

What carries the argument

The 2-factor of exactly two odd circuits together with its complementary 1-factor containing precisely three spokes, which permits explicit construction of the four covering perfect matchings.

If this is right

The edges of G lie in the union of four perfect matchings.
G satisfies the 7/5-conjecture of Alon and Tarsi.
The covering result continues to hold when the 1-factor contains an arbitrary number of chords in addition to the three spokes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The structural hypothesis on the 1-factor may serve as a base case from which more general cubic graphs could be reduced.
Techniques developed for two odd circuits might extend to 2-factors with additional odd circuits under controlled spoke counts.
It would be natural to test whether the three-spoke bound can be relaxed while preserving the four-matching cover.

Load-bearing premise

The graph has a 2-factor of exactly two odd circuits whose complementary 1-factor contains precisely three spokes.

What would settle it

A cubic graph with a 2-factor of exactly two odd circuits whose complementary 1-factor has exactly three spokes, yet whose edges cannot be covered by any collection of four perfect matchings.

read the original abstract

Let $G$ be a cubic graph admitting a $2$-factor consisting of exactly two odd circuits, and let the complementary $1$-factor contain precisely three spokes (along with an arbitrary number of chords). We show that four perfect matchings can cover $G$. As a consequence, $G$ fulfils the 7/5-Conjecture of Alon and Tarsi.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This settles the 7/5-conjecture for the narrow class of cubic graphs with a 2-factor of exactly two odd circuits and exactly three spokes in the complementary 1-factor.

read the letter

The paper establishes that any cubic graph whose 2-factor consists of exactly two odd circuits, with the complementary 1-factor containing exactly three spokes, admits a cover by four perfect matchings. This settles the 7/5-conjecture for precisely those graphs. The new part is the handling of this configuration with three spokes. Previous work has looked at other 2-factor setups, but the explicit three-spoke case with two odd circuits gets a direct proof here. The authors break it down by the possible ways the spokes connect the circuits and interact with the chords. In each case they exhibit the four matchings explicitly. That case-by-case construction is the strength. It is elementary and leaves little room for hidden errors if the cases are exhaustive. The deduction to the 7/5-conjecture is immediate once the cover exists. The obvious soft spot is how specialized the hypothesis is. Most cubic graphs will not have a 2-factor with exactly two odd circuits and exactly three spokes in the complement. So this does not advance the general conjecture in a big way. It is honest progress on a subcase, but readers hoping for a broader attack will be disappointed. This paper is for specialists in graph theory who follow the Alon-Tarsi conjecture and related matching problems in cubic graphs. Someone collecting verified instances or looking for techniques in case analysis would get value from it. It is solid enough to deserve a serious referee, even though the result is limited in scope. I recommend sending it to peer review.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that any cubic graph G admitting a 2-factor consisting of exactly two odd circuits, where the complementary 1-factor contains precisely three spokes (plus arbitrary chords), admits a cover by four perfect matchings. This immediately implies that such graphs satisfy the 7/5-conjecture of Alon and Tarsi.

Significance. The result supplies an explicit, constructive verification of the 7/5-conjecture for a narrowly defined but nontrivial family of cubic graphs. The proof proceeds by exhaustive case analysis on the placement of the three spokes relative to the two odd circuits and the chords, yielding concrete partitions of the edge set into four matchings in each case. This constructive character is a clear strength.

minor comments (2)

The title refers to 'two adjacent odd circuits' while the abstract and theorem statement speak only of 'exactly two odd circuits'; a brief clarifying sentence on whether adjacency is an additional hypothesis or follows from the 2-factor structure would remove any ambiguity.
A short table summarizing the cases, the spoke configurations, and the resulting four matchings would improve readability of the case analysis.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, the recognition of the constructive nature of the proof, and the recommendation to accept the manuscript.

Circularity Check

0 steps flagged

Direct constructive proof with no circularity

full rationale

The paper establishes the 4-cover result for the stated narrow class of cubic graphs via explicit case analysis on the placement of the three spokes relative to the two odd circuits and any chords in the complementary 1-factor. Each case directly partitions the edges into four perfect matchings from the given structure, without fitted parameters, self-referential definitions, or load-bearing self-citations. The deduction that such graphs satisfy the 7/5-Conjecture follows immediately as a corollary from the covering. The derivation is self-contained against the structural assumptions and does not reduce any claim to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies exclusively on standard graph-theoretic definitions and does not introduce fitted parameters, new axioms beyond background mathematics, or invented entities.

axioms (1)

standard math Standard definitions of cubic graphs, 2-factors, 1-factors, perfect matchings, odd circuits, spokes, and chords.
These are foundational concepts assumed known from prior graph theory literature.

pith-pipeline@v0.9.0 · 5365 in / 1208 out tokens · 43594 ms · 2026-05-12T04:35:48.065262+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
We show that four perfect matchings can cover G. As a consequence, G fulfils the 7/5-Conjecture of Alon and Tarsi.
IndisputableMonolith/Foundation/DimensionForcing.lean alexander_duality_circle_linking unclear
Hamiltonian cubic 3-pole (G,H) has a proper 4-cover (Theorem 3.1)

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

[1]

3, P3.54

Marién Abreu, Tomáš Kaiser, Domenico Labbate, and Guiseppe Mazzuoccolo,Treelike snarks, Electronic Journal of Combinatorics23(2016), no. 3, P3.54

work page 2016
[2]

3, 345–350

Noga Alon and Michael Tarsi,Covering multigraphs by simple circuits, SIAM Journal on Algebraic and Discrete Methods6(1985), no. 3, 345–350

work page 1985
[3]

J. A. Bondy and U. S. R. Murty,Graph theory, Graduate Texts in Mathematics, vol. 244, Springer, 2008

work page 2008
[4]

4, 468–488

Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, and Klas Markström,Generation and properties of snarks, Journal of Combinatorial Theory, Series B103(2013), no. 4, 468–488

work page 2013
[5]

Gunnar Brinkmann and Steven Van Overberghe,Algorithms for the generation of snarks, arXiv preprint arXiv:2603.17789 (2026)

work page arXiv 2026
[6]

173, Springer, 2017

Reinhard Diestel,Graph theory, 5 ed., Graduate Texts in Mathematics, vol. 173, Springer, 2017

work page 2017
[7]

2, 144–157

Louis Esperet and Giuseppe Mazzuoccolo,On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings, Journal of Graph Theory77(2014), no. 2, 144–157

work page 2014
[8]

1, 133–138

Genghua Fan and André Raspaud,Fulkerson ’s conjecture and circuit covers, Journal of Combinatorial Theory, Series B61(1994), no. 1, 133–138

work page 1994
[9]

Jean-Luc Fouquet and Jean-Michel Vanherpe,On the perfect matching index of certain cubic graphs, arXiv preprint arXiv:0802.3474 (2008)

work page arXiv 2008
[10]

3, 387–396

Ján Karabáš, Edita Máčajová, Roman Nedela, and Martin Škoviera,Berge’s conjecture for cubic graphs with small colouring defect, Journal of Graph Theory109(2025), no. 3, 387–396

work page 2025
[11]

,Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi, arXiv preprint arXiv:2505.17569 (2025)

work page arXiv 2025
[12]

Plummer,Matching theory, Annals of Discrete Mathematics, vol

László Lovász and Michael D. Plummer,Matching theory, Annals of Discrete Mathematics, vol. 29, North- Holland, 1986

work page 1986
[13]

Edita Máčajová and Martin Škoviera,Cubic graphs that cannot be covered with four perfect matchings, Journal of Combinatorial Theory, Series B150(2021), 144–176

work page 2021
[14]

20, 2292–2296

Giuseppe Mazzuoccolo,Covering a cubic graph with perfect matchings, Discrete Mathematics313(2013), no. 20, 2292–2296

work page 2013
[15]

Schönberger,Ein beweis des petersenschen graphensatzes, Acta Scientiarum Mathematicarum (Szeged)7 (1934), 51–57

T. Schönberger,Ein beweis des petersenschen graphensatzes, Acta Scientiarum Mathematicarum (Szeged)7 (1934), 51–57

work page 1934
[16]

3, 195–206

Eckhard Steffen,1-factor and cycle covers of cubic graphs, Journal of Graph Theory78(2015), no. 3, 195–206

work page 2015
[17]

3, 367–387

George Szekeres,Polyhedral decomposition of cubic graphs, Bulletin of the Australian Mathematical Society8 (1973), no. 3, 367–387

work page 1973
[18]

Martin Škoviera and Peter Varša,Deciding whether four perfect matchings can cover the edges of a snark is np-complete, Theor. Comput. Sci.988(2024), 114374. (J. Karabáš)FEEIT, Slov ak University of Technology, Ilkovičov a 3, 84104 Bratisla v a, Slov akia (J. Karabáš)Mathematical Institute of Slov ak Academy of Sciences, Ďumbierska 1, 97411 Banská Bystrica...

work page 2024