{"id":"6e097b4a-7250-4e01-8961-a8b8bb7f613d","arxiv_id":"2607.22267","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every bridgeless graph avoiding the minor Q=P/e (the Petersen graph with one edge contracted) admits a nowhere-zero 4-flow.","lead":"This mathematics paper proves that every bridgeless multigraph that does not contain a certain contraction of the Petersen graph as a minor has a nowhere-zero 4-flow. The result narrows what any counterexample to Tutte's 4-flow conjecture would have to look like.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central theorem depends on the finite Lemmas 3.1–3.2 being correct; these are verified only by an unaudited Python script, so the proof's validity rests on that artifact executing correctly.","rationale":"I traced the full logical chain: from a bridgeless Q-minor-free graph, the proof passes to a flow-minimal minor, applies Lemma 4.1 to obtain an almost 4-connected graph of minimum degree at least three and girth at least five, and then splits into planar (Four-Colour Theorem) and nonplanar cases. The nonplanar case uses Theorem 3.3, whose proof depends on the Thomas–Thomson base-minor theorem and the Norin–Thomas extension theorem; the only base case needing new work is the dodecahedron, where Lemma 3.2 and Lemma 3.1 carry the full burden. I manually spot-checked the three base-graph branch models in Table A.1 and the four dodecahedral models in Table A.2; they are plausible and the dodecahedral models use the added edges exactly where needed. I found no internal inconsistency in the flow reduction, in the use of Norin–Thomas, or in the excluded-minor relationships. The remaining soft spot is purely evidential: the finite certificates are asserted to be machine-checked, but the machine check was not executed during review and no independent verification is provided. Since a single computational error in the orbit classification or in one of the seven minor models would invalidate the central theorem, acceptance should be conditional on running and independently reproducing the supplied verifier. Once that is done, the paper's argument should hold.","tokens_in":7136,"tokens_out":39537,"duration_ms":328317,"concrete_test":"Download verify_Q_minor.py from Zenodo doi:10.5281/zenodo.21498923 and run `python3 verify_Q_minor.py`. Then independently reimplement the crucial checks: (1) compute Aut(D) with a second method (e.g., nauty/traces or a separately written backtracker) and verify that its order is 120, that the noncofacial pairs are represented by {0,3}, {0,4}, {0,5}, and that the facial-cross orbit has size 60; (2) for all seven branch models, recompute nonemptiness, connectivity, pairwise disjointness, and the required Q-edges in the correct host (including the added dodecahedral edges); (3) as a further guard, test at least one non-representative jump extension and one alternative cross extension directly, to confirm the orbit reduction is not skipping a class. If all checks pass, the concern is resolved; if any check fails, Theorem 3.3 collapses.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorem 3.3, the structural core of Theorem 1.1, reduces to Lemma 3.2: every jump or cross extension of the dodecahedron contains Q as a minor. Lemma 3.2's universality is supplied by Lemma 3.1, which asserts an exact automorphism-orbit classification of the 20-vertex dodecahedron. The seven branch-set certificates in Tables A.1–A.2 and the orbit classification are checked by the supplied Python verifier, but the reader did not execute it and no independent verification is reported. This is the one place where the argument has no external theorem to lean on: a single invalid branch set (e.g., a branch set not connected in the extended host, or a missing host edge for a Q-adjacency) or a missed orbit of noncofacial pairs would leave an extension class unverified and invalidate Theorem 3.3. In particular, Lemma 3.1's 'exact backtracking' automorphism enumeration is trusted; if it undercounts Aut(D), the representatives {0,3}, {0,4}, {0,5} and the single cross representative might not cover all extensions. The finite statements are checkable, so the risk is not the mathematics but the absence of an independently executed certificate.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that every almost 4-connected nonplanar graph with minimum degree at least three and girth at least five contains the graph Q = P/e (the Petersen graph with one edge contracted) as a minor (Theorem 3.3). Combining this structural result with Thomas and Thomson's minimal-obstruction lemmas and the planar case (Four-Colour Theorem), the paper proves the main theorem (Theorem 1.1): every finite bridgeless multigraph with no Q minor admits a nowhere-zero Z_2^2-flow, hence a nowhere-zero 4-flow. A corollary is that every bridgeless graph with no nowhere-zero 4-flow contains both P−e and Q as minors. The proof uses the Thomas–Thomson girth-five structure theorem, the Norin–Thomas nonplanar extension theorem, and a computer-assisted finite verification (Lemma 3.1 and Lemma 3.2) that covers the dodecahedral base case and explicitly lists Q-minor models in the Petersen, Triplex, Basket, and dodecahedral extension graphs.","tokens_in":7394,"tokens_out":10156,"duration_ms":94314,"significance":"If the result is correct, it is a genuine advance in the programme around Tutte's 4-flow conjecture: it moves from the previously known excluded-minor classes for P(3) and P(2) to the larger class Ex(Q), where Q is the largest proper minor of the Petersen graph in the contraction chain. The structural proof is elegant and avoids any parameter fitting: Theorem 3.3 is a clean reduction to prior published structure theorems plus a small finite check. A notable strength is the transparency of the computer-assisted part: the paper supplies a self-contained deterministic verifier, explicit branch-set certificates in Tables A.1–A.2, and the orbit classification of Lemma 3.1. The argument contains no circularity and makes the finite footprint precise. The main residual risk is reproducibility of the finite verification, not internal inconsistency.","major_comments":[],"minor_comments":[{"comment":"The central theorem depends on the exactness of the computer-assisted orbit classification and the seven Q-minor branch sets. The verifier is supplied, which is good, but the manuscript does not include a transcript of a successful run or a machine-readable certificate of the output. I did not independently execute the script. Since a missed orbit or an invalid branch set would invalidate Theorem 3.3, please include in the supplementary material the exact output of verify_Q_minor.py (e.g., 'ALL_CERTIFICATES_VALID') and, if possible, an independent check of the orbit counts (for instance using nauty) or a human-readable list of the representatives. This is a reproducibility request rather than a mathematical gap.","section":"§3, Lemmas 3.1 and 3.2"},{"comment":"The labelled dodecahedron is defined by three displayed cycles and a list of remaining edges. It would help the reader to state explicitly that the twelve 5-cycles listed in Appendix A are exactly the facial cycles used by Lemma 3.1, and that the cross representative is taken with respect to the face (0,1,2,12,10). The current text implies this but could be more explicit.","section":"Appendix A / Figure 1"},{"comment":"There are a few minor typographical issues, e.g., the spacing in 'δ −(v)' in Section 2 and the phrase '3-connected P(3)-minor-free graphs' in the Introduction where a hyphen after 'P(3)' is missing. These do not affect the mathematics.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"The paper's only residual risk is the unaudited finite verification. The supplied code and explicit certificates are strong evidence, but I was not able to run the script as part of this review. If the editor can arrange for an independent execution of verify_Q_minor.py, or request that the authors provide a transcript and a second independent enumeration, the remaining reproducibility concern would be resolved. The mathematical structure of the proof is otherwise sound and the result is significant."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThe short version: this is a real extension. Pintér proves every bridgeless graph with no P/e minor has a nowhere-zero 4-flow, where P/e is the Petersen graph with one edge contracted. The excluded-minor class is strictly larger than the P(3)-minor-free class covered by Wang–Zhang–Zhang, and the corollary is a nice narrowing of the 4-flow conjecture: any counterexample must contain both P/e and P–e as minors.\n\nThe proof is arranged honestly. It combines Thomas–Thomson’s girth-five structure theorem with Norin–Thomas’s nonplanar extension theorem, and reduces the new work to a finite statement. The finite part is explicit: seven branch-set models in Tables A.1–A.2, plus an automorphism-orbit calculation for the dodecahedron. The Python verifier is on Zenodo and is described well enough that a referee can run it. That is more than most papers in this area do. The labeling and the reduction via Lemma 2.3 are clean.\n\nThe soft spot is exactly where the stress-test lands: Lemmas 3.1 and 3.2 carry the whole theorem. If the orbit enumeration misses an automorphism, or any branch set in the tables is not connected in the host graph, the jump/cross extension case collapses. I did not run the script, and no independent run is reported. But this is a checkable risk, not a mathematical gap. The code is simple and deterministic, the appendix gives the branch sets in full, and a referee can verify them in an hour. The only caveat is that no external theorem backs these finite claims; the proof is only as good as that script.\n\nThere is no circularity, no parameter fitting, and the citation pattern is straight. The paper cites the structural theorems it depends on and positions itself correctly against the prior results. I have no substantive concern about the main argument beyond the finite certificates.\n\nBottom line: send it to a serious referee. Ask that referee to run the Python script and spot-check a couple of branch sets. If the certificates check out, the theorem is solid and the corollary is a useful step toward Tutte’s 4-flow conjecture. I would cite it.\n\nBest","headline":"A genuinely new theorem extending Petersen-exclusion 4-flows to P/e-minor-free graphs, with a clean structural proof and an explicit finite check that deserves an independent run.","tokens_in":7922,"tokens_out":3207,"would_cite":true,"duration_ms":31729,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C21","05C83"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every bridgeless graph without a contracted-Petersen minor has a nowhere-zero 4-flow.","keywords":["nowhere-zero 4-flow","graph minor","Petersen graph","excluded minor","girth five","Z2^2-flow","almost 4-connected","computer-assisted proof"],"falsifier":"Run the supplied verifier (or an independent implementation) and confirm that the Dodecahedron automorphism group has 120 elements, that the representatives {0,3}, {0,4}, {0,5} cover the noncofacial orbits, that the facial cross orbit is single, and that Tables A.1 and A.2 contain valid Q-minor models; any failure of these checks would invalidate the structural theorem and the main flow result.","tokens_in":6985,"feed_emoji":"🌊","tokens_out":10514,"duration_ms":85381,"temperature":0.7,"pith_summary":"The paper proves that the Petersen graph with one edge contracted, denoted P/e, is the deciding excluded minor for the nowhere-zero 4-flow problem: every finite bridgeless multigraph that does not contain P/e as a minor has a flow over Z2×Z2, hence a 4-flow. The core structural result shows that every almost 4-connected nonplanar graph of minimum degree at least three and girth at least five contains P/e as a minor, and the flow statement follows by a standard minimal-counterexample reduction. The proof leans on the known girth-five classification of high-girth graphs into four base graphs (Triplex, Petersen, Dodecahedron, Basket) and a nonplanar extension theorem, with a computer-assisted finite check that every extension of the Dodecahedron (the only base graph that does not already contain P/e) also contains P/e. Consequently, if the result is correct, any bridgeless graph that fails to have a nowhere-zero 4-flow must contain both P/e and the single-edge-deleted Petersen graph P-e as minors, which sharpens the known border of the 4-flow conjecture.","feed_headline":"Every bridgeless graph with no contracted-Petersen minor has a 4-flow","feed_subtitle":"It proves any 4-flow counterexample must contain both Petersen one-edge minors.","key_machinery":"The central object is Q = P/e, the graph obtained by contracting one edge of the Petersen graph; it has nine vertices and fourteen edges, with one degree-four vertex and eight degree-three vertices. The proof is carried by two theorems about girth-five graphs: the structure theorem that every graph with minimum degree at least three and girth at least five has a minor among Triplex, Petersen, Dodecahedron, and Basket, and the extension theorem that an almost 4-connected nonplanar graph containing a subdivision of an almost 4-connected planar triangle-free graph must contain either a jump extension (the planar graph plus one edge joining two vertices that lie on no common facial cycle) or a c","core_discovery":"On its own terms, the paper establishes Theorem 3.3: an almost 4-connected nonplanar graph with minimum degree at least three and girth at least five must contain the nine-vertex graph Q = P/e (the Petersen graph with one edge contracted) as a minor. This feeds into Theorem 1.1, which states that every finite bridgeless multigraph with no Q minor has a nowhere-zero flow over Z2×Z2 and therefore a nowhere-zero 4-flow. The only base minor not already containing Q is the Dodecahedron, and the paper reduces all possible nonplanar extensions of the Dodecahedron to four representatives by an automorphism-orbit calculation, then exhibits explicit Q-minor models for each. The flow part is a standard","pith_inferences":["If the result stands, the 4-flow conjecture is reduced to understanding graphs that contain both P-e and P/e; a possible path is to show such graphs contain a larger Petersen-like obstruction.","The automorphism-orbit reduction used for the Dodecahedron suggests a general template: compress infinite families of planar-graph extensions into a few orbit representatives, then verify by computer.","A next natural step is to exclude the graph P^(2) (Petersen with two matched edges contracted); the same structural and finite-verification approach may extend the flow theorem to that class.","Because a Z2×Z2-flow in a cubic graph is equivalent to a proper 3-edge-colouring, the theorem also proves the cubic edge-colouring conjecture for every cubic graph without a Q minor."],"forward_implications":["The class of bridgeless graphs with no Q minor is now known to admit nowhere-zero 4-flows, a strict superset of previously handled classes excluding larger Petersen contractions.","Any bridgeless graph without a nowhere-zero 4-flow must contain both P-e and P/e as minors (Corollary 1.2), so these two one-edge Petersen modifications are individually necessary in any counterexample to the 4-flow conjecture.","The structural theorem 3.3 gives a new unavoidable-minor statement for almost 4-connected nonplanar graphs of girth at least five, which can be applied to other minor-exclusion problems.","The computer-assisted finite part is reproducible with a single deterministic Python script, making the minor certificates auditable."],"fun_headline_variants":["Bridgeless graphs without contracted Petersen minor have 4-flows","No contracted Petersen minor yields a nowhere-zero 4-flow","4-flow counterexamples contain both Petersen one-edge minors","Bridgeless multigraphs without P/e admit 4-flows"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The theorem stands or falls on the exact correctness of the finite certificates: the Dodecahedron's noncofacial vertex pairs must form exactly the three automorphism orbits listed, the facial crosses one orbit, and the seven branch-set tables in the appendix must each be valid Q-minor models.","fun_headline_variants_meta":{"raw":{"variants":["Bridgeless graphs without contracted Petersen minor have 4-flows","No contracted Petersen minor yields a nowhere-zero 4-flow","4-flow counterexamples contain both Petersen one-edge minors","Bridgeless multigraphs without P/e admit 4-flows"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000656,"raw_usage":{"total_tokens":2845,"prompt_tokens":756,"completion_tokens":2089,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":500,"completion_tokens_details":{"reasoning_tokens":2016}},"tokens_in":500,"tokens_out":2089,"duration_ms":15019,"temperature":1.0,"reasoning_tokens":2016,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T05:16:35.512167+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the supplied verifier (or an independent implementation) and confirm that the Dodecahedron automorphism group has 120 elements, that the representatives {0,3}, {0,4}, {0,5} cover the noncofacial orbits, that the facial cross orbit is single, and that Tables A.1 and A.2 contain valid Q-minor models; any failure of these checks would invalidate the structural theorem and the main flow result.","supporting_citations":[],"review_version":1}