Erdős Problem #637 — Many distinct degrees in a large induced subgraph of a Ramsey graph
Statement
For every constant , do there exist constants such that every -vertex graph with no clique or independent set larger than contains an induced subgraph on at least vertices in which at least vertices have pairwise distinct degrees?
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.