Erdős Problem #1031 — Large induced regular subgraphs in Ramsey graphs
Statement
For every constant , does there exist such that every graph on vertices with no clique or independent set of size at least contains a nonempty induced regular subgraph on at least vertices?
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.