Burr–Erdős–Faudree–Rousseau–Schelp one-sided Ramsey-infiniteness conjecture
Statement
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.
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.