Erdős Problem #79 — Minimal obstructions to Ramsey size linearity
Statement
Call a graph Ramsey size linear if for every graph with edges and no isolated vertices. Are there infinitely many graphs that are not Ramsey size linear although every proper subgraph is?
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.