Infinitely many Ramsey-close but non-equivalent pairs
Statement
For finite graphs and , let be the set of graphs that are Ramsey-minimal for one of but do not arrow the other. The graphs and are Ramsey close if is finite, and they are Ramsey equivalent if . 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 . The known example and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.