Burr–Erdős–Faudree–Rousseau–Schelp one-sided Ramsey-infiniteness conjecture
Burr–Erdős–Faudree–Rousseau–Schelp one-sided Ramsey-infiniteness conjecture
Let and be graphs. A pair 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 -component is a connected component isomorphic to . Burr–Erdős–Faudree–Rousseau–Schelp conjecture. The pair is Ramsey-infinite unless both and are odd stars or at least one of and contains a -component. This is deliberately a one-sided assertion: the exceptional conditions are not claimed to characterize all Ramsey-finite pairs, since pairs with a -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.