ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.