Burr's stronger finite-characterization conjecture for Ramsey-minimal graph families
Let and be graphs, and let denote the family of Ramsey-minimal graphs for the pair . A matching is a graph whose connected components are all isomorphic to ; denotes the star with leaves. Burr's conjecture. The family is finite if and only if either one of and is a matching, or both and are of the form with a positive odd integer and . This proposed characterization is stronger than the two 1981 one-sided statements.
References
Status
- Refuted: Yaping Mao. Ramsey-finiteness for graph pairs: A complete solution to the Burr-Erdős-Faudree-Schelp conjectures (arXiv, 2026) https://arxiv.org/abs/2604.17356
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
No solutions have been posted yet.