ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥2k\ge 2 be a positive integer, let nn be sufficiently large, and let GG be an nn-vertex graph. Write f(G)f(G) for the maximum number of distinct degrees in an induced subgraph of GG, and let hom⁡(G)\hom(G) denote the maximum size of a homogeneous set in GG. Distinct-degree strengthening. If

hom⁡(G)<nk−1,\hom(G)<\frac{n}{k-1},

then

f(G)≥k.f(G)\ge k.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.