ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs, and let K2K_2 denote the complete graph on two vertices. A pair (G,H)(G,H) is Ramsey-finite if it has only finitely many Ramsey-minimal graphs. Burr–Erdős–Faudree–Rousseau–Schelp conjecture. If (G,H)(G,H) is Ramsey-finite, then (G∪ℓK2,H∪mK2)(G\cup \ell K_2,H\cup mK_2) is Ramsey-finite for all integers ℓ,m≥0\ell,m\ge 0. 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 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.