{"id":"53e8b442-158b-48bc-a944-489b0909fc5c","arxiv_id":"2507.21565","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For a solid brick other than K4, every b-invariant edge is solitary if and only if the graph is a wheel W_n, which forces n to be even.","lead":"The paper shows that among highly connected graphs called solid bricks, the only ones in which every special removable edge lies in exactly one perfect matching are the even wheels. This answers the solid-brick case of an open characterization problem in matching theory posed by Lucchesi and Murty.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Cubic case depends entirely on unverified external Theorem 1.2 of [9]; if that classification is incomplete, the necessity proof of Theorem 1.3 has no support for solid cubic bricks.","rationale":"The reader's weakest assumption identifies the same concern I would: the cubic case is outsourced to Theorem 1.2 of [9]. I read the rest of the proof looking for an internal inconsistency. The construction of P from the two solitary edges, the alternating-path arguments in Lemmas 3.1-3.3, and the geometric reduction to a wheel in Lemmas 3.4-3.7 appear coherent: each step either uses solidity to produce a pair of disjoint odd cycles with a perfect matching in the remainder, or uses Lemma 2.3 to bound nonsolitary edges. I did not find a concrete local error. The remaining objection is not that the theorem is false but that a central branch of the necessity proof is not self-contained and depends on an unreviewed preprint by overlapping authors. If Theorem 1.2 is accepted, the paper's main result is plausible and the novelty is real; if not, the paper needs either an independent proof of the cubic case or a proof of the weaker lemma that K4 is the only solid cubic brick. Since this condition was already identified by the reader and my review does not move the verdict, I recommend no change from CONDITIONAL.","tokens_in":9858,"tokens_out":35377,"duration_ms":412822,"concrete_test":"Independently re-derive the cubic branch of Section 3 without citing Theorem 1.2: prove the weaker lemma that K4 is the only solid cubic brick, equivalently that every solid cubic brick distinct from K4 has a vertex of degree at least four. If the lemma is true, the cubic case can be rewritten with a short self-contained argument and the external dependency disappears. If the lemma is false, construct the counterexample and compute its b-invariant edges and perfect-matching counts; a counterexample with all b-invariant edges solitary would falsify Theorem 1.3, while one without the property would show the cubic branch needs case analysis rather than a blanket citation.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In the necessity proof, the first step splits on whether G has a vertex of degree at least four. If not, G is cubic, and the paper immediately invokes Theorem 1.2 of [9] to conclude that G must lie in the nonsolid family G (Section 3, first paragraph). This is the only argument ruling out all cubic solid bricks other than K4. Theorem 1.2 is a full classification of cubic bricks with the solitary-edge property, stated without proof and taken from an unreviewed arXiv preprint by overlapping authors; the claim that every graph in G is nonsolid is also asserted without proof. If Theorem 1.2 has a gap, the main theorem is unproved for every cubic solid brick, and the long self-contained development in Lemmas 3.1-3.7 cannot repair that branch. The statement of Theorem 1.3 covers all solid bricks, so this external dependency is load-bearing.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Lucchesi-Murty problem of characterizing bricks, other than K4, \\overline{C6}, and the Petersen graph, in which every b-invariant edge is solitary. The main result, Theorem 1.3, states that for a solid brick G of even order n other than K4, every b-invariant edge of G is solitary if and only if G is a wheel W_n. The sufficiency is proved in Lemma 2.4. The necessity proof splits into a cubic and a non-cubic case. In the non-cubic case the paper selects a vertex u of degree at least 4, uses the uniqueness of the two perfect matchings of G-{u,u1} and G-{u,u2}, analyzes their symmetric difference as an alternating path P, and then uses a sequence of lemmas (3.1-3.7) to force every vertex of a certain cycle C to have degree 3 and to be adjacent to u, yielding the wheel structure. In the cubic case the proof invokes Theorem 1.2 from reference [9], an external classification of cubic bricks with the same solitary-edge property.","tokens_in":10022,"tokens_out":15026,"duration_ms":174263,"significance":"If the proof is completed, the paper gives a clean structural characterization inside the class of solid bricks: the property that all b-invariant edges are solitary is a complete fingerprint for even wheels. The main contribution is the self-contained alternating-path analysis of the non-cubic case, which appears plausible and uses standard matching-theoretic tools. The paper makes progress on a problem from Lucchesi and Murty's book and identifies exactly where the cubic case needs external input. The main caveats are that the cubic case depends entirely on an unreviewed arXiv preprint by overlapping authors, and that several solidity contradictions are asserted rather than demonstrated. These are load-bearing issues, but they do not appear to require changing the overall strategy.","major_comments":[{"comment":"The entire cubic branch of the necessity proof is outsourced to Theorem 1.2 of [9]. The proof argues that if G has no vertex of degree at least 4, then G is a cubic brick, and Theorem 1.2 is invoked to conclude G belongs to the family G; the additional assertion that every graph in G is nonsolid (only stated in the Introduction as 'easily seen') then yields the contradiction. No proof of Theorem 1.2 is included, and [9] is an arXiv preprint by overlapping authors. Since Theorem 1.3 covers all solid bricks, this external classification is load-bearing: if [9] contains a gap, the theorem is unproved for every cubic solid brick. The authors should either provide a self-contained proof of the cubic case, include a complete proof of Theorem 1.2 as an appendix, or restrict the statement of Theorem 1.3 to non-cubic solid bricks.","section":"§3, first paragraph (necessity)"},{"comment":"The solidity contradictions in the proof of Lemma 3.4 are asserted rather than demonstrated. For example, in Claim 1 the proof says 'one can obtain that C1 and C2 are two vertex disjoint odd cycles of G such that G − (V(C1) ∪ V(C2)) has a perfect matching,' and similar statements appear in Claim 2 for C1,C3 and later for C1,C5. Since the whole point is to violate solidity, the perfect matching in the complement of two explicitly constructed odd cycles must be exhibited or its existence argued step by step. This is not a cosmetic omission: these claims are the only places where the hypothesis that G is solid is used to force the alternating-path structure. Please supply the matchings, or at least a uniform argument showing that one of M1 or M2 (or a fixed alternating-path matching) avoids both cycles.","section":"§3, Lemma 3.4 (Claims 1 and 2) and Lemmas 3.5–3.7"}],"minor_comments":[{"comment":"The abstract writes 'C6' where the text elsewhere uses '\\overline{C6}'; the overline is missing. Also 'everyb-invariant edge' is missing a space.","section":"Abstract"},{"comment":"The definition of N(X) reads 'the set of all the vertices in X that have one neighbour in X', which is garbled; presumably it should say the vertices outside X that have a neighbour in X, or something equivalent. Please correct.","section":"§2, notation"},{"comment":"The three subgraphs F1, F2, F3 are defined almost entirely through Figure 3; the verbal description is too terse. A reader cannot check the case analysis without reconstructing the figure from the text. Please list the edge sets of F1, F2, F3 explicitly.","section":"§3, Lemma 3.4"},{"comment":"The assertion that every graph in the family G is nonsolid is stated as 'easily seen' but no verification is provided. Since this fact is used in the cubic case, either add a short proof or give an explicit reference to where it is established.","section":"Introduction"},{"comment":"The theorem states 'G is a wheel W_n' without specifying parity; since W_n is a brick only for even n (and W_4 = K_4 is excluded), the statement should clarify that n is even. Lemma 2.4 already assumes n even.","section":"Theorem 1.3 and Lemma 2.4"}],"recommendation":"major_revision","confidential_remarks":"The dependence on reference [9] is the main editorial risk. It is an unreviewed arXiv preprint with overlapping authorship, so the main theorem is conditional on an item not independently vetted. I would ask the authors to either secure acceptance or publication of [9], or to provide a self-contained proof of the cubic case, before the paper is accepted. The missing perfect-matching demonstrations in Lemma 3.4 are also important for verifiability, but they appear to be fillable within the manuscript's scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nTwo things to know. First, the main theorem is genuinely new: among solid bricks other than K4, all b-invariant edges are solitary if and only if the brick is an even wheel. That is a natural special case of the Lucchesi-Murty problem and it is not a routine corollary of earlier work. Second, the proof for the non-cubic case is a serious structural argument using alternating paths and the solidity condition; it is long but coherent. The soft spot is the cubic case: the necessity proof simply invokes Theorem 1.2 of an unreviewed arXiv preprint by overlapping authors, and that theorem is doing all the work to rule out cubic solid bricks. If Theorem 1.2 has a gap, the main theorem is unsupported for every cubic solid brick.\n\nWhat the paper does well: the sufficiency is a short check. The necessity splits at a natural place—if some vertex has degree at least four, the self-contained lemmas force the whole graph to be a wheel. Lemma 3.4 and its descendants are intricate but plausible. The exposition is clear, and the external classification is used as a black box, not hidden.\n\nThe soft spots in proportion: the external dependency is load-bearing, and the paper does not verify Theorem 1.2 or provide an independent argument for the cubic solid-brick case. That is a real gap that a referee should press. The claim that every graph in the family G is nonsolid is asserted with 'we can easily see' and not proved; this is minor since it should be checkable from the figure, but it should be written down. There is also a notational slip: the abstract says \\overline{C_6} while the body says C6; presumably the body means the 6-vertex triangular prism, and this should be fixed.\n\nWho is this for: people working in matching theory, specifically on bricks and removable edges. It is a meaningful contribution to that community. It deserves a serious referee—not a desk reject—because the main theorem is important enough and the non-cubic proof is substantive. My recommendation is to send it to review, with an explicit request that the authors either prove Theorem 1.2 or make its status clear and supply a proof of the cubic solid-brick case.","headline":"Clean characterization of solid bricks with all b-invariant edges solitary, but the cubic case rests on an unverified external classification.","tokens_in":10537,"tokens_out":3736,"would_cite":true,"duration_ms":38888,"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":"Theorem: for a solid brick G other than K4, every b-invariant edge of G is solitary exactly when G is a wheel W_n.","keywords":["solid brick","b-invariant edge","solitary edge","wheel graph","matching covered graph","removable edge","tight cut decomposition"],"falsifier":"Enumerate all solid bricks on 6 to 12 vertices, compute for each graph the set of b-invariant edges and the number of perfect matchings containing each; the theorem predicts that the only graphs whose b-invariant edges each lie in exactly one perfect matching are the wheels W_6, W_8, W_10 and W_12. Any other solid brick found with this property would refute the theorem.","tokens_in":9660,"feed_emoji":"🎡","tokens_out":6202,"duration_ms":67209,"temperature":0.7,"pith_summary":"This paper establishes a structural characterization in matching theory: among solid bricks, the graphs whose b-invariant edges are all solitary are exactly the wheels of even order, with K4 excluded. A b-invariant edge is a removable edge whose deletion does not change the brick decomposition; a solitary edge is one that lies in exactly one perfect matching. The result answers a restricted version of an open problem for the solid class, converting a global matching condition into a single recognizable shape. A sympathetic reader should care because it shows that, once solidity is assumed, the solitary-edge condition is strong enough to force a wheel.","feed_headline":"Solid bricks with only solitary b-invariant edges are even wheels","feed_subtitle":"A graph-matching property forces the whole brick into a single hub-and-rim shape.","key_machinery":"The carrying object is the alternating path P obtained as the symmetric difference G[M1 ∆ M2] of the two unique perfect matchings M1 and M2 that belong to two solitary edges uu1 and uu2 at a vertex u of degree at least four. Since each Mi is the unique perfect matching of G - {u, ui}, any M1- or M2-alternating cycle in the relevant graph would contradict uniqueness. The solidity of G then acts as a global constraint: it forbids pairs of vertex-disjoint odd cycles that leave a perfect matching behind, which is exactly what rules out alternative routes from the path into the rest of the graph. Repeatedly applying this constraint forces all vertices outside the path to attach to u and to each other only along the path, yielding the rim of a wheel.","core_discovery":"The paper proves Theorem 1.3: for a solid brick G of order n distinct from K4, every b-invariant edge of G is solitary if and only if G is a wheel W_n. The necessity argument assumes the solitary-edge property, first rules out cubic bricks by appealing to an external classification theorem that says the only cubic bricks with the property are nonsolid, and then treats a vertex u of degree at least four. Two solitary edges incident to u supply two unique perfect matchings; their symmetric difference forms an alternating path. The bulk of the proof uses the solidity of G to forbid alternating cycles and paths that would violate the uniqueness of these matchings, gradually forcing every remaining vertex to lie on a single cycle C whose vertices are all adjacent to u. With no vertices left outside C ∪ {u}, G is a wheel.","pith_inferences":["The same technique may characterize solid bricks in which all but a bounded number of b-invariant edges are solitary; the proof only needs two solitary incident edges at a high-degree vertex to get started.","If the external cubic classification were extended to cubic braces or near-bricks, the main theorem's necessity proof would become self-contained for the cubic case.","A computational check over solid bricks up to moderate order would test the theorem's edge cases, since the structural lemmas suggest the wheel is the unique extremal shape."],"forward_implications":["A solid brick other than K4 is a wheel exactly when all its b-invariant edges are solitary, so the two properties coincide inside the solid class.","Outside wheels, every solid brick has at least one b-invariant edge that belongs to two or more perfect matchings.","The nonsolid graphs that satisfy the solitary condition, such as those appearing in the cubic classification, are essential: none of them can be solid.","The proof's alternating-path decomposition provides a reusable local-to-global argument for classifying solid bricks by matching uniqueness."],"supporting_citations":[{"why":"Supplies the external classification of cubic bricks with the same solitary-edge property, used to rule out the cubic case in the necessity proof.","marker":"[9]"},{"why":"Proves that in a solid brick every removable edge is b-invariant, bridging the removability condition to the b-invariant condition.","marker":"[2]"},{"why":"Gives the degree bound that at most two edges incident to a vertex are nonremovable in a solid brick, which underlies the bound on nonsolitary edges.","marker":"[3]"},{"why":"Establishes the 3-connected characterization of bricks, giving the minimum degree at least three used throughout the proof.","marker":"[4]"},{"why":"Poses Problem 1.1, the characterization question that this paper answers for the solid class.","marker":"[8]"}],"fun_headline_variants":["Solid bricks with solitary b-invariant edges must be wheels","Solitary b-invariant edges force solid bricks to be wheels","If every b-invariant edge is solitary, a solid brick is a wheel","Solitary b-invariant edges imply wheels for solid bricks"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof that cubic solid bricks cannot satisfy the property is not proved here; it rests entirely on a classification theorem from another paper, so the main theorem inherits the correctness of that external result.","fun_headline_variants_meta":{"raw":{"variants":["Solid bricks with solitary b-invariant edges must be wheels","Solitary b-invariant edges force solid bricks to be wheels","If every b-invariant edge is solitary, a solid brick is a wheel","Solitary b-invariant edges imply wheels for solid bricks"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000458,"raw_usage":{"total_tokens":2259,"prompt_tokens":871,"completion_tokens":1388,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":487,"completion_tokens_details":{"reasoning_tokens":1316}},"tokens_in":487,"tokens_out":1388,"duration_ms":12764,"temperature":1.0,"reasoning_tokens":1316,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T12:37:13.342418+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all solid bricks on 6 to 12 vertices, compute for each graph the set of b-invariant edges and the number of perfect matchings containing each; the theorem predicts that the only graphs whose b-invariant edges each lie in exactly one perfect matching are the wheels W_6, W_8, W_10 and W_12. Any other solid brick found with this property would refute the theorem.","supporting_citations":[{"cited_title":"Carvalho, C.L","cited_arxiv_id":null,"evidence_quote":"Proves that in a solid brick every removable edge is b-invariant, bridging the removability condition to the b-invariant condition."},{"cited_title":"Carvalho, C.L","cited_arxiv_id":null,"evidence_quote":"Gives the degree bound that at most two edges incident to a vertex are nonremovable in a solid brick, which underlies the bound on nonsolitary edges."},{"cited_title":"Edmonds, L","cited_arxiv_id":null,"evidence_quote":"Establishes the 3-connected characterization of bricks, giving the minimum degree at least three used throughout the proof."},{"cited_title":"Lucchesi, U.S.R","cited_arxiv_id":null,"evidence_quote":"Poses Problem 1.1, the characterization question that this paper answers for the solid class."}],"review_version":1}