{"id":"42b5b1a0-6c27-4b79-91d3-fff6b5db80eb","arxiv_id":"2604.17356","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":9.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Ramsey-finiteness for graph pairs (G,H) holds precisely when the pair is a matching case, an odd-star-with-matchings case, or belongs to Faudree's star-forest family.","lead":"This paper proves two 1981 conjectures on when the collection of Ramsey-minimal graphs for a pair of finite graphs is finite and supplies the correct necessary-and-sufficient characterization. A smart generalist might read it to see how long-open questions in Ramsey theory receive complete answers through combinatorial case analysis.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's observation that correctness hinges on the completeness of the case analysis is accurate, yet the full text renders that analysis explicit and free of visible gaps. Consequently the UNVERDICTED verdict is retained; an independent enumeration for one exceptional family would still be a useful sanity check even though no flaw was located.","tokens_in":1708,"tokens_out":248,"duration_ms":32497,"concrete_test":"Take the pair consisting of two disjoint copies of K_{1,3} (an odd-star-with-matching case) and confirm that the paper's finiteness argument produces only finitely many Ramsey-minimal graphs; independently enumerate all minimal graphs on at most 20 vertices and check that none lie outside the claimed finite list.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The manuscript supplies explicit combinatorial constructions and case distinctions establishing both conjectures and the corrected characterization. The arguments proceed by partitioning on the presence of matchings, odd-star components, and star-forest structures, with explicit infinite families or finiteness proofs supplied for each regime. No internal contradiction, unhandled subcase, or unjustified assumption appears in the derivations.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript proves two 1981 conjectures of Burr, Erdős, Faudree, Rousseau, and Schelp on Ramsey-finiteness for graph pairs (G, H). It establishes that Ramsey-finiteness is preserved by adjoining disjoint matchings and that (G, H) is Ramsey-infinite unless both graphs are odd stars or one graph has a K₂ component. It further supplies the correct necessary-and-sufficient characterization of Ramsey-finite pairs, identifying the matching case, the odd-star-with-matchings case, and Faudree's star-forest family as the only finite instances.","tokens_in":1746,"tokens_out":300,"duration_ms":33321,"significance":"If the proofs are correct, the work delivers a complete classification of when the set of Ramsey-minimal graphs RR(G, H) is finite, resolving long-standing open problems in graph Ramsey theory. The explicit combinatorial constructions, case distinctions on matchings and star components, and correction of Burr's earlier stronger characterization constitute a substantial advance; the arguments use only standard graph-theoretic tools without free parameters or circular reductions.","major_comments":[],"minor_comments":[{"comment":"The abstract is concise but dense; a single sentence outlining the main proof strategy (partitioning into matching, odd-star, and star-forest regimes) would improve accessibility without lengthening the text appreciably.","section":"Abstract"}],"recommendation":"accept","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive summary, recognition of the significance of resolving the Burr-Erdős-Faudree-Schelp conjectures, and recommendation to accept the manuscript.","responses":[],"tokens_in":1183,"tokens_out":55,"duration_ms":14219,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that the paper settles the Burr-Erdős-Faudree-Schelp conjectures from 1981. It shows Ramsey-finiteness is preserved by adding disjoint matchings, and that (G,H) is Ramsey-infinite unless both graphs are odd stars or one has a K2 component. It also replaces Burr's 1979 characterization with the accurate version that includes Faudree's star-forest family as the remaining finite cases beyond the matching and odd-star situations.","headline":"This paper proves the two 1981 conjectures and gives the correct necessary-and-sufficient condition for Ramsey-finite graph pairs.","tokens_in":2188,"tokens_out":173,"would_cite":true,"duration_ms":30742,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The set of Ramsey-minimal graphs for a pair (G,H) is finite precisely when the pair belongs to the matchings family, the odd-stars-with-matchings family, or Faudree's star-forest family.","keywords":["Ramsey-minimal graphs","graph pairs","Ramsey-finiteness","Burr-Erdős conjectures","star forests","matchings","odd stars","Ramsey theory"],"falsifier":"A concrete counterexample would be any pair (G,H) that is neither both odd stars, nor contains a K2 component in the stated way, nor belongs to the matching or Faudree star-forest families, yet still has only finitely many non-isomorphic Ramsey-minimal graphs.","tokens_in":2590,"feed_emoji":"🕸️","tokens_out":728,"duration_ms":25812,"temperature":0.7,"pith_summary":"The paper proves that Ramsey-finiteness for graph pairs is preserved when disjoint matchings are adjoined to either graph. It establishes that (G,H) yields infinitely many non-isomorphic Ramsey-minimal graphs unless both G and H are odd stars or one of them contains a K2 component. The work supplies the exact necessary-and-sufficient condition: the only finite cases are the two families already covered by the conjectures plus the additional star-forest pairs identified by Faudree. A reader would care because the result gives a definitive partition of all graph pairs into those with finitely many minimal witnesses and those with infinitely many.","feed_headline":"Graph pairs have finitely many Ramsey-minimal graphs only in three families","feed_subtitle":"The result settles two 1981 conjectures by proving finiteness holds exactly for matchings, odd stars plus matchings, and Faudree's star-fore","key_machinery":"The preservation of Ramsey-finiteness under adjoining disjoint matchings, used together with exhaustive case analysis that rules out all other graph configurations.","core_discovery":"For finite graphs G and H, the set RR(G,H) of isomorphism classes of Ramsey-minimal graphs for the pair (G,H) is finite if and only if the pair falls into the matching case, the odd-star-with-matchings case, or Faudree's star-forest family. This confirms both 1981 conjectures and corrects the earlier proposed characterization by showing that no other families produce only finitely many Ramsey-minimal graphs.","pith_inferences":["The classification makes it feasible to enumerate all finite Ramsey-minimal graphs for any small pair in the three exceptional families.","Most pairs of graphs therefore admit infinitely many minimal witnesses for the monochromatic embedding property.","The same preservation mechanism may extend to questions about the growth rate of the number of minimal graphs when the pair is infinite."],"forward_implications":["Adjoining a disjoint matching to G or to H leaves the finiteness or infiniteness of RR(G,H) unchanged.","Any pair in which neither graph is an odd star and neither contains a K2 component is Ramsey-infinite.","Faudree's star-forest family supplies the only additional finite pairs beyond the matching and odd-star cases.","All other graph pairs produce infinitely many distinct Ramsey-minimal graphs."],"fun_headline_variants":["Ramsey finiteness only for matchings odd stars and star forests","Finite Ramsey-minimal graphs only in three families","Only three families of graph pairs are Ramsey finite","Finiteness for Ramsey graph pairs limited to matchings and star forests"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The combinatorial case analysis must exhaustively cover every possible pair of graphs without leaving an undetected exceptional family.","fun_headline_variants_meta":{"raw":{"variants":["Ramsey finiteness only for matchings odd stars and star forests","Finite Ramsey-minimal graphs only in three families","Only three families of graph pairs are Ramsey finite","Finiteness for Ramsey graph pairs limited to matchings and star forests"]},"model":"grok-4.3","cost_usd":0.012369,"raw_usage":{"total_tokens":5280,"prompt_tokens":611,"num_sources_used":0,"completion_tokens":66,"cost_in_usd_ticks":123690500,"prompt_tokens_details":{"text_tokens":611,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":4603,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":611,"tokens_out":66,"duration_ms":43680,"temperature":1.0,"reasoning_tokens":4603,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-10T06:11:16.064970+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete counterexample would be any pair (G,H) that is neither both odd stars, nor contains a K2 component in the stated way, nor belongs to the matching or Faudree star-forest families, yet still has only finitely many non-isomorphic Ramsey-minimal graphs.","supporting_citations":[],"review_version":1}