ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For finite graphs H1H_1 and H2H_2, let D(H1,H2){\mathcal{D}}(H_1,H_2) be the set of graphs that are Ramsey-minimal for one of H1,H2H_1,H_2 but do not arrow the other. The graphs H1H_1 and H2H_2 are Ramsey close if D(H1,H2){\mathcal{D}}(H_1,H_2) is finite, and they are Ramsey equivalent if D(H1,H2)=∅{\mathcal{D}}(H_1,H_2)=\emptyset. A graph is Ramsey-infinite if it has infinitely many Ramsey-minimal graphs.

Ramsey-closeness conjecture. There are infinitely many pairs of Ramsey-infinite graphs which are Ramsey close but not Ramsey equivalent.

The conjecture would follow from affirmative answers to the paper's preceding questions concerning the possible finite cardinalities of D(H1,H2){\mathcal{D}}(H_1,H_2). The known example K3K_3 and K3+K2K_3+K_2 is Ramsey close but not Ramsey equivalent, with exactly one graph in the corresponding difference set; infinitely many such pairs remain unestablished.

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.