Burr–Erdős–Faudree–Rousseau–Schelp one-sided Ramsey-infiniteness conjecture

Let GG and HH be graphs. A pair (G,H)(G,H) is Ramsey-infinite if it has infinitely many Ramsey-minimal graphs. An odd star is a star with an odd number of leaves, and a K2K_2-component is a connected component isomorphic to K2K_2. Burr–Erdős–Faudree–Rousseau–Schelp conjecture. The pair (G,H)(G,H) is Ramsey-infinite unless both GG and HH are odd stars or at least one of GG and HH contains a K2K_2-component. This is deliberately a one-sided assertion: the exceptional conditions are not claimed to characterize all Ramsey-finite pairs, since pairs with a K2K_2-component can still be Ramsey-infinite. The paper states that this conjecture is true.

Sources & referencesView supporting material

Primary source

Yaping Mao, “Ramsey-finiteness for graph pairs: A complete solution to the Burr-Erdős-Faudree-Schelp conjectures”, arXiv:2604.17356 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.