Many distinct degrees from large homogeneous sets
Statement
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 . Large-homogeneous-set conjecture. If
then
The statement concerns extending the lower bound suggested by the proof of the main theorem to graphs with smaller homogeneous sets; the source presents it as something the authors believe should be possible to prove.
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.