Ramsey-finiteness for graph pairs: A complete solution to the Burr-Erdős-Faudree-Schelp conjectures

Abstract: For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erdős, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining disjoint matchings, and $(G,H)$ is Ramsey-infinite unless both graphs are odd stars or one graph has a $K_2$ component. We also refute Burr's stronger 1979 survey conjecture via an explicit finite counterexample from the star-forest theorem, and reformulate Faudree's 1991 theorem as a complete forest-classification corollary.

• The paper establishes a complete classification of Ramsey-minimal graph pairs, proving finiteness only for specific configurations such as odd stars and matching extensions.
• It employs advanced asymmetric random Ramsey theory alongside classical inductive methods to derive explicit thresholds for when the Ramsey-minimal families are finite.
• The authors refute Burr’s strong conjecture with concrete counterexamples, unifying past sporadic results and clarifying critical structural boundaries in Ramsey theory.

Resolution of Ramsey-Finiteness for Graph Pairs and the Burr-Erdős-Faudree-Schelp Conjectures

Introduction and Background

The paper "Ramsey-finiteness for graph pairs: A complete solution to the Burr-Erdős-Faudree-Schelp conjectures" (2604.17356) provides a definitive classification of Ramsey-finite graph pairs, settling longstanding conjectures in graph Ramsey theory. The central object of study is the family $R(G,H)$ of Ramsey-minimal graphs for a pair $(G,H)$, where $G$ and $H$ are finite graphs. A graph $F$ is Ramsey-minimal for $(G,H)$ if every red-blue edge coloring of $F$ contains a red $G$ or a blue $H$, but deleting any edge destroys this property.

The key question, posed in the 1970s and 1980s, concerns the finiteness of $R(G,H)$. Most nontrivial pairs yield infinite Ramsey-minimal families; exceptional pairs yielding finite $(G,H)$0 are of special combinatorial interest. The paper addresses two 1981 conjectures of Burr, Erdős, Faudree, Rousseau, and Schelp—which posit that Ramsey-finiteness is preserved under matching extension and that, except for odd stars and matchings, all other graph pairs are Ramsey-infinite—as well as Burr’s failed survey conjecture, which aimed to narrowly characterize all Ramsey-finite pairs.

Main Results

The principal contributions are encapsulated in Theorem 1 of the paper, which rigorously settles the conjectures:

1. Ramsey-infiniteness of most pairs: If neither $(G,H)$1 nor $(G,H)$2 contains a $(G,H)$3 (edge) component and they are not both odd stars, then $(G,H)$4 is infinite.
2. Preservation by matching extension: If $(G,H)$5 is finite, then so is $(G,H)$6 for all $(G,H)$7.
3. Falsity of Burr's strong conjecture: There exist concrete finite pairs, such as $(G,H)$8, that fall outside Burr’s survey characterization, disproving the equivalence he conjectured.

Additionally, the work offers a full forest-case classification, confirming and extending results due to Faudree, and uses contemporary tools from random Ramsey theory to bridge earlier gaps.

Numerical and Structural Highlights

• An explicit finite pair outside Burr's conjectured forms is exhibited: $(G,H)$9 is finite, even though neither side is a pure odd star plus matching.
• The formal classification (Corollary) for forest pairs combines combinatorial conditions on the structure and parameters of component stars and matchings, including explicit thresholds for Ramsey-finiteness.

Proof Strategies and Technical Advances

The technical core includes three main advances:

1. Asymmetric Random Ramsey Theory Application:

The proof that both cyclic $G$0 and $G$1 forces $G$2 to be infinite leverages the recently resolved Kohayakawa–Kreuter conjecture for asymmetric Ramsey thresholds. For pairs where both $G$3 and $G$4 contain cycles, the authors apply probabilistic threshold theorems to show there exist graphs of arbitrarily large order that are Ramsey-minimal for $G$5, establishing infinitude in this regime.

2. Structural Induction via Classical Results:

For forests and star forests, the argument proceeds by induction, iteratively applying classical finiteness lemmas (such as adjoinment of matchings and Faudree’s subgraph lemma) to deduce that finiteness persists under matching extension and that exceptions are exhausted by known benign structures.

3. Counterexample Construction:

The explicit counterexample to Burr’s survey conjecture directly applies earlier work (notably Theorem 11 of [BERS81]), showing that certain star-combined graphs with a large enough matching side yield finite Ramsey-minimal families, yet are not of the conjectured form.

Implications and Theoretical Consequences

Theoretical Framework Completion:

The results settle open problems and provide a conclusive taxonomy for which finite graphs pairs admit only finitely many Ramsey-minimal graphs—at least when both graphs are forests, stars, or mixtures with matchings. This classification unifies prior sporadic results and demonstrates that, outside a sharply delineated set of exceptions (odd stars and their matching extensions), the typical case is infinite.

Methodological Significance:

A notable aspect is the application of recent advances in random Ramsey theory, both symmetric and asymmetric, to classical combinatorial problems. This cross-pollination indicates a maturation of probabilistic methods within Ramsey theory and suggests that further deep results in extremal graph theory may be similarly approachable.

Refutation of Overly Restrictive Conjectures:

The explicit refutation of Burr’s strong conjecture clarifies the precise boundaries of Ramsey-finiteness and corrects misconceptions in the combinatorial literature, showing that the interaction of star forests with large matchings can produce new, otherwise unexpected, finite families.

Outlook and Future Developments

Future research may explore three directions:

• Extension to hypergraphs and higher arities: The sharp dichotomies elucidated here for finite graphs invite analogous questions in uniform hypergraphs, where the combinatorial landscape is richer and less well-understood.
• Algorithmic enumeration: The precise classification may aid in developing algorithms to enumerate all Ramsey-minimal witnesses for given forest pairs, beneficial for computational Ramsey theory.
• Randomized Ramsey-minimal constructions: The methods suggest further employment of random graph models to understand structural properties of Ramsey-minimal graphs in broader contexts, potentially informing extremal and probabilistic combinatorics.

Conclusion

This paper establishes a comprehensive solution to the Ramsey-finiteness problem for graph pairs, confirming two major historical conjectures, refuting an overly general one, and cementing the role of star forests and matchings as the exclusive sources of Ramsey-finite behavior outside trivial cases. By integrating classical combinatorial arguments with contemporary probabilistic tools, it supplies the definitive Ramsey-minimal graph classification in the forest regime and clarifies conceptual boundaries in an enduring branch of extremal graph theory (2604.17356).