Distinct-degree strengthening for graphs with small homogeneous sets
Statement
Let be a positive integer, let be sufficiently large, and let be an -vertex graph. Write for the maximum number of distinct degrees in an induced subgraph of , and let denote the maximum size of a homogeneous set in . Distinct-degree strengthening. If
then
This is presented as a strengthening of the paper's main theorem and is left as a suspected statement rather than proved.
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.