Burr–Erdős–Faudree–Rousseau–Schelp conjecture on adding matching components
Statement
Let and be graphs, and let denote the complete graph on two vertices. A pair is Ramsey-finite if it has only finitely many Ramsey-minimal graphs. Burr–Erdős–Faudree–Rousseau–Schelp conjecture. If is Ramsey-finite, then is Ramsey-finite for all integers . This conjecture concerns the stability of Ramsey-finiteness under adjoining arbitrary numbers of isolated matching components to the two target graphs. The paper states that this conjecture is true.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.