{"id":"4a9c9356-fdd3-47f1-ae86-a44c61196ab7","arxiv_id":"2412.16465","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every wheel-like brick lies in a recursively defined family obtained by splicing odd wheels, and every minimal matching covered graph has minimum degree 2 or 3.","lead":"A new structural proof shows that every wheel-like brick, a special kind of 3-connected graph tied to perfect matchings, can be built by gluing odd wheel graphs together. The same tools prove that every minimal matching covered graph with more than two vertices has minimum degree 2 or 3.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Claim 1 of Theorem 1.3 asserts without proof that lifted removable edges e1 and e2 are nonadjacent; this is not automatic, so the induction lacks support.","rationale":"The reader's weakest_assumption focuses on the reliability of Corollary 2.9 and Lemma 2.10 from the unpublished preprint [13]. That is a legitimate concern, but the more specific load-bearing problem I find is an unsupported internal assertion in the proof of Theorem 1.3: Claim 1 needs two nonadjacent removable edges in G to contradict wheel-likeness, yet the written proof simply states nonadjacency without justification. The definitions and the bipartite decomposition do not force disjointness, and the standard example of an odd wheel shows that many removable edges can all be incident with one hub and therefore pairwise adjacent. The same gap appears again in the paragraph after Claim 1, where e from Lemma 2.18 and e0 are asserted to be nonadjacent. This means the induction proving that both contracted graphs are wheel-like is not fully demonstrated in the manuscript. I do not think this warrants rejection, because the gap may be repairable with a more careful choice of e1 and e2 or with an additional lemma, and the overall strategy remains plausible. It does, however, strengthen the case for a conditional verdict: the proof needs to be completed or revised before the main theorems are accepted as fully verified.","tokens_in":17324,"tokens_out":18801,"duration_ms":165368,"concrete_test":"Re-derive the endpoint sets of e1 and e2 in Claim 1 using only Lemmas 2.11 and 2.12 and the bipartition of H, and attempt to construct a bipartite matching covered H with x',x'' in different color classes together with two edges e1,e2 that share a vertex, each lying in a removable class of the corresponding contraction G' and G''. If such H can be realized by a brick with robust cuts, the assertion 'e1 and e2 are nonadjacent' is false. At minimum, the proof must supply a missing argument showing the lifts can be chosen disjoint; otherwise Claim 1 is unproved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The weakest point is not only the imported Corollary 2.9 and Lemma 2.10, but an internal step in Claim 1 of the proof of Theorem 1.3. After choosing removable classes R1 in G' and R2 in G'' with R1∩∂(x')=∅ and R2∩∂(x'')=∅, the proof says: 'there exist two edges, e1 and e2, such that e1∈R1, e2∈R2 and both ... are removable in G ... Note that e1 and e2 are nonadjacent.' No argument is given. This does not follow from the preceding definitions: the lifted edges may share a vertex v∈V\\(X'∪X''), or one may be incident with the other's contracted vertex. The fact that H is bipartite with x' and x'' in different color classes does not prevent two of its edges from sharing a vertex. If e1 and e2 are adjacent, the contradiction with wheel-likeness fails, since all spokes of an odd wheel are removable and pairwise adjacent at the hub. The same unjustified nonadjacency assertion recurs when Lemma 2.18 is invoked to produce e and e0. Consequently, even if every imported lemma is correct, the induction does not rigorously establish that G' and G'' are wheel-like, so the conclusion G∈G is not supported by the written proof.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies matching covered graphs, focusing on wheel-like bricks and minimal matching covered graphs. It defines a recursively constructed family G of graphs obtained by splicing odd wheels and K4-type graphs with prescribed conditions on hubs and non-removable edges, and claims in Theorem 1.3 that every wheel-like brick belongs to G. It then uses properties of wheel-like bricks to prove Theorem 1.4, that every minimal matching covered graph on at least four vertices has minimum degree 2 or 3. The proof is inductive and relies on the tight-cut decomposition theory of bricks, robust cuts, and splicing operations, together with several recent lemmas from the authors' own preprint [13] and from Carvalho-Lucchesi-Murty.","tokens_in":17564,"tokens_out":14801,"duration_ms":117928,"significance":"If correct, Theorem 1.3 gives a structural necessary condition for all wheel-like bricks, addressing a problem of Lucchesi and Murty, and Theorem 1.4 provides a sharp minimum-degree bound for all minimal matching covered graphs, extending the classical Lovász-Plummer result for bipartite graphs. The paper contributes a concrete recursive family G and shows that the structural result can be applied to a separate extremal problem. The proof strategy is plausible and the use of robust cuts and splicing is appropriate. However, the correctness of the central inductive proof is not yet established, because several non-adjacency assertions and some 'it can be checked' steps are not justified; these gaps are load-bearing for the main theorems.","major_comments":[{"comment":"The sentence \"Note that e1 and e2 are nonadjacent\" is not justified. The preceding construction only ensures that e1 is not incident with x' in G' and e2 is not incident with x'' in G''; the edges may share a vertex in V(G)\\ (X' ∪ X'') or one may be incident with an endpoint of the other. The bipartiteness of H and the fact that x' and x'' lie in different color classes do not rule out adjacency. Since the contradiction with the wheel-like property requires two removable edges that are not both incident with the hub, this step is load-bearing. The same unjustified non-adjacency assertion recurs in Claim 2 when e1 and e3, or e and e0, are declared nonadjacent. Please supply a proof or a case analysis.","section":"Section 3, Proof of Theorem 1.3, Claim 1"},{"comment":"In the subcase where H2 contains a removable edge and ∂H1(u) contains both removable and nonremovable edges, the proof states that V(H1)\\ {u} contains a vertex s2 of degree 3 \"by the minimality of V(G)\". The minimality of G only rules out a smaller bicritical graph with all vertices except its hub of degree at least 4 and with some nonremovable edge incident with the hub. If the only degree-3 vertex in V(H1)\\ {u} is the contracted vertex x, then H1 is not a counterexample and no vertex of G of degree 3 is obtained. The argument must rule out this possibility; otherwise Lemma 3.13, which is essential for Theorem 1.4, is not established.","section":"Section 3, Lemma 3.13"},{"comment":"The assertion \"it can be checked that every edge of ∂H1(k) is not removable in H1\" is nontrivial. Edges of ∂H1(k) lie in both ∂(V(K))-contractions, so Lemma 2.11 alone does not imply their non-removability in H1 from the minimality of G. Since this is the basis for concluding that H1 is minimal and for the subsequent contradiction with the minimal choice of G, a detailed verification is needed.","section":"Section 4, Proof of Theorem 1.4, Claim A"}],"minor_comments":[{"comment":"The proofs of Theorems 1.3 and 1.4 rely on Lemma 2.10 and Lemma 3.8 from the authors' unpublished preprint [13]. If the paper is intended to be self-contained, these dependencies should be stated more prominently, and the relevant statements should ideally be proved or clearly labeled as external.","section":"Section 2, Lemma 2.10 and Section 3, Lemma 3.8"},{"comment":"The proof of Corollary 2.9 contains two \"it can be checked\" steps in the maximum-barrier argument; please spell out these checks so that the proof can be independently verified.","section":"Section 2, Corollary 2.9"},{"comment":"There are minor textual issues: on page 5, \"The the degree of u\" should read \"The degree of u\"; the paragraph defining G states that \"The vertex of a graph in G with the maximum degree is called a hub of it,\" which should be made conditional on the uniqueness of the maximum-degree vertex, as established in Lemma 3.9.","section":"Section 1 and Section 3"}],"recommendation":"major_revision","confidential_remarks":"The paper depends heavily on the same authors' unpublished preprint [13], which supplies Lemmas 2.10, 3.4, 3.7 and 3.8. The editor may wish to verify the status of [13] and whether the overlap affects novelty. The proof of Theorem 1.3 contains a substantive gap in Claim 1 concerning non-adjacency of the constructed removable edges, and Lemma 3.13 has a similar unresolved point; these should be repaired before acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on arXiv:2412.16465. The two main results are genuinely new and worth having: a one-way structural decomposition for wheel-like bricks (Theorem 1.3) and a sharp minimum-degree theorem for minimal matching covered graphs (Theorem 1.4, delta between 2 and 3). The wheel-like result extends the planar case from the same group's preprint, and the min-degree theorem is a clean generalization of Lovasz-Plummer. The high-level strategy is sensible: induction via robust cuts for Theorem 1.3, and a barrier-contraction argument for Theorem 1.4.\n\nBut the written proof has several gaps, and they are not cosmetic. The most serious is in Claim 1 of Theorem 1.3. The proof asserts that two lifted removable edges e1 and e2, one from each of the two contracted bricks, are nonadjacent. That does not follow: the two edges can meet at a vertex in V(G) minus (X' union X''). Without nonadjacency, the contradiction with wheel-likeness collapses, and since this is the step that forces G' and G'' to be wheel-like, the induction is unsupported. The same unjustified nonadjacency reappears when Lemma 2.18 is invoked. Separately, the lifting step itself ('both are removable in G by Lemmas 2.11 and 2.12') needs a more careful argument, because a single removable edge in one contraction need not lift to G unless it is removable in both contractions, which is not the case here.\n\nTheorem 1.4 has a more mechanical problem: in Claim A, the proof defines H2 = H1/(Y -> y), says every edge incident with y is removable in H2, then says every such edge is not removable in H2. That is an internal contradiction; probably a typo (the two contractions got mixed up), but it needs fixing. There is also an omitted subcase: when the final bicritical graph G' has no removable edge, the proof jumps to the removable case; Prop 3.12 gives the needed degree-3 vertex, so this is repairable, but it is not in the text.\n\nFinally, several key lemmas (2.10, 3.7, 3.8) come from an unpublished preprint by two of the same authors. That does not make them wrong, but it means the referees cannot verify the foundation without a second document.\n\nMy overall take: the results are likely true and the paper deserves a serious referee. But it is not ready as written; the nonadjacency gap is load-bearing. If the authors can supply a proof of that step (or a different route to the induction), this becomes a solid contribution.","headline":"Genuinely new theorems, but the main structural proof has an unsupported nonadjacency step; worth refereeing after repairs.","tokens_in":807,"tokens_out":1750,"would_cite":false,"duration_ms":91169,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C70","05C40","05C75"],"pacs":[],"model":"deepseek-v4-flash","headline":"A wheel-like brick is always obtainable by splicing odd wheels and K4-type graphs, and minimal matching covered graphs have minimum degree 2 or 3.","keywords":["wheel-like bricks","matching covered graphs","removable edges","removable doubletons","bricks","tight cuts","splicing","minimum degree"],"falsifier":"An explicit search would settle the matter: enumerate all minimal matching covered graphs on small vertex sets (allowing multiple edges) and look for one with minimum degree at least $4$; Theorem 1.4 predicts that none exists. For the structure theorem, take the smallest wheel-like brick not obviously in $\\mathcal{G}$, apply the robust-cut decomposition of Corollary 2.9, and check whether the two pieces are again wheel-like and satisfy the splicing conditions; any wheel-like brick that cannot be rebuilt from smaller wheel-like bricks this way would falsify Theorem 1.3.","tokens_in":17094,"feed_emoji":"🧩","tokens_out":13317,"duration_ms":106255,"temperature":0.7,"pith_summary":"This paper answers a structural question in matching theory: what must a brick look like when every removable class—an edge that can be deleted, or a pair of edges that can be deleted together, while every edge still lies in a perfect matching—has an edge incident with one special vertex? The proposed answer is Theorem 1.3: every such wheel-like brick belongs to $\\mathcal{G}$, the recursively defined family of graphs obtained by splicing odd wheels (with possible multiple edges) and $K_4$-type graphs subject to conditions on hubs and nonremovable edges. The same machinery yields Theorem 1.4: every minimal matching covered graph with at least four vertices has minimum degree $2$ or $3$, so no minimal matching covered graph can be, for example, 4-regular. The significance is twofold: it resolves the necessary direction of the Lucchesi–Murty characterization problem, and it extends the known bipartite minimum-degree result to all matching covered graphs.","feed_headline":"Wheel-like bricks are built by splicing odd wheels","feed_subtitle":"Structural proof: every minimal matching covered graph has a vertex of degree 2 or 3.","key_machinery":"The engine is the splicing operation $G(u) \\odot H(v)$: it deletes vertices $u$ and $v$ and joins their incident edges according to a bijection, producing a new graph whose degree sequence is unchanged away from the splice. The paper builds the family $\\mathcal{G}$ recursively from odd wheels, where an odd wheel $W_k$ is a cycle of odd length whose vertices are all joined to a hub. The proof of Theorem 1.3 runs on robust cuts: separating cuts that are not tight (do not meet every perfect matching in exactly one edge) and whose two contractions are near-bricks (graphs containing a single brick). Corollary 2.9 supplies a robust cut whose two double contractions yield a bipartite matching covered graph with the two contracted vertices in different color classes, and Lemma 2.10 says every edge incident with one of those contracted vertices is removable; these facts let the induction peel a wheel-like brick into smaller wheel-like bricks.","core_discovery":"On the paper's own terms, the central discovery is that wheel-like bricks are exactly the graphs obtainable by repeatedly splicing odd wheels: Theorem 1.3 states $G \\in \\mathcal{G}$ for every wheel-like brick $G$, where $\\mathcal{G}$ is built level by level from wheel-like odd wheels (including $K_4$ with multiple edges) by splicing operations $G_j(u_j) \\odot H_j(v_j)$ that obey two kinds of rules: the splicing vertex of one piece must be the hub (or the maximum-degree set) in a prescribed way, and any edge of the $K_4$-piece that is nonremovable must correspond, after splicing, to an edge that does not touch the hub of the other piece. The proof is an induction on the number of vertices. Every nonsolid brick is split by a robust cut; the double contraction is bipartite and matching covered, and the imported Lemma 2.10 guarantees that all edges incident with the contracted vertex are removable there. That forces both pieces of the split to be wheel-like, so the induction applies. Theorem 1.4 then uses barrier reduction to show that a minimal matching covered graph with minimum degree at least $4$ would force a bicritical graph with a removable edge and then a degree-$3$ vertex, a contradiction.","pith_inferences":["Editorial inference: the recursive description of $\\mathcal{G}$ gives a natural recognition procedure for wheel-like bricks: repeatedly split along robust cuts, verify each piece is an odd wheel or $K_4$-type graph, and check the splice conditions; this would turn the existence proof into an algorithm.","Editorial inference: because the paper notes that not every graph in $\\mathcal{G}$ is wheel-like, the remaining open direction of the characterization is to describe exactly which graphs in $\\mathcal{G}$ satisfy the extra wheel-like condition; Lemma 3.8 already does this for pure two-wheel splices.","Editorial inference: the minimum-degree theorem suggests a concrete strengthening to look for: in every minimal matching covered graph, the vertices of degree $2$ or $3$ should be locatable through the barrier contraction process used in the proof, possibly giving a canonical decomposition into low-degree cores and spliced even cycles."],"forward_implications":["Every wheel-like brick with more than four vertices has exactly one maximum-degree hub, and every edge incident with that hub is removable (Lemma 3.9).","The characterization problem for wheel-like bricks is reduced to identifying which members of $\\mathcal{G}$ are wheel-like, since the paper shows the converse inclusion is false.","No minimal matching covered graph on at least four vertices can have minimum degree $4$ or more; the bound $\\delta(G) \\in \\{2,3\\}$ is sharp, attained by even cycles, $K_4$, and the triangular prism.","The earlier result that minimal matching covered bipartite graphs have minimum degree $2$ now extends to all matching covered graphs, without a bipartiteness assumption."],"supporting_citations":[{"why":"Supplies Theorem 1.1, the lower bound on removable classes of a brick, used to force a common hub for the two pieces in the induction.","marker":"[2]"},{"why":"Supplies Theorem 2.8, the existence of a robust cut with a solid contraction, from which the paper derives the double-contraction decomposition Corollary 2.9.","marker":"[5]"},{"why":"Provides the standard framework for bricks, tight cuts and removable classes, the statement of the open characterization problem for wheel-like bricks, and Propositions 2.5, 2.7, 3.1 and Theorem 3.3.","marker":"[8]"},{"why":"Supplies the bicritical graph facts used in the minimum-degree proof, including barrier structure and 2-separation cuts.","marker":"[10]"},{"why":"Supplies the tight cut decomposition results and the characterization of tight cuts in bipartite graphs used in the P-set arguments.","marker":"[12]"},{"why":"Supplies the companion lemmas on wheel-like splicing, including Lemma 2.10 on removability at the contracted vertex, and Lemmas 3.4, 3.7, 3.8.","marker":"[13]"},{"why":"Supplies Proposition 3.12 that bicritical graphs without removable edges have at least four degree-3 vertices, the key contradiction in Theorem 1.4.","marker":"[15]"}],"fun_headline_variants":["Wheel-like bricks are spliced odd wheels","Minimal matching covered graphs: min degree 2 or 3","Splicing odd wheels builds all wheel-like bricks","Every wheel-like brick is a spliced odd wheel"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of the structure theorem assumes that every nonsolid brick can be split along a robust cut whose two contracted sides each contain only one brick and whose double contraction is bipartite with the two contracted vertices on opposite parts; if a single nonsolid brick failed to split this way, the induction that produces the characterization would break.","fun_headline_variants_meta":{"raw":{"variants":["Wheel-like bricks are spliced odd wheels","Minimal matching covered graphs: min degree 2 or 3","Splicing odd wheels builds all wheel-like bricks","Every wheel-like brick is a spliced odd wheel"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000844,"raw_usage":{"total_tokens":3735,"prompt_tokens":1065,"completion_tokens":2670,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":681,"completion_tokens_details":{"reasoning_tokens":2605}},"tokens_in":681,"tokens_out":2670,"duration_ms":16682,"temperature":1.0,"reasoning_tokens":2605,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T10:34:57.455731+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"An explicit search would settle the matter: enumerate all minimal matching covered graphs on small vertex sets (allowing multiple edges) and look for one with minimum degree at least $4$; Theorem 1.4 predicts that none exists. For the structure theorem, take the smallest wheel-like brick not obviously in $\\mathcal{G}$, apply the robust-cut decomposition of Corollary 2.9, and check whether the two pieces are again wheel-like and satisfy the splicing conditions; any wheel-like brick that cannot be rebuilt from smaller wheel-like bricks this way would falsify Theorem 1.3.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Theorem 1.1, the lower bound on removable classes of a brick, used to force a common hub for the two pieces in the induction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies Theorem 2.8, the existence of a robust cut with a solid contraction, from which the paper derives the double-contraction decomposition Corollary 2.9."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the standard framework for bricks, tight cuts and removable classes, the statement of the open characterization problem for wheel-like bricks, and Propositions 2.5, 2.7, 3.1 and Theorem 3.3."},{"cited_title":"Lov´ asz and M","cited_arxiv_id":null,"evidence_quote":"Supplies the bicritical graph facts used in the minimum-degree proof, including barrier structure and 2-separation cuts."},{"cited_title":"Lov´ asz, Matching structure and the matching lattice, J","cited_arxiv_id":null,"evidence_quote":"Supplies the tight cut decomposition results and the characterization of tight cuts in bipartite graphs used in the P-set arguments."},{"cited_title":"Planar wheel-like bricks","cited_arxiv_id":"2410.20692","evidence_quote":"Supplies the companion lemmas on wheel-like splicing, including Lemma 2.10 on removability at the contracted vertex, and Lemmas 3.4, 3.7, 3.8."},{"cited_title":"Zhang, X","cited_arxiv_id":null,"evidence_quote":"Supplies Proposition 3.12 that bicritical graphs without removable edges have at least four degree-3 vertices, the key contradiction in Theorem 1.4."}],"review_version":1}