ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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. Large-homogeneous-set conjecture. If

hom⁡(G)>n1/2,\hom(G)>n^{1/2},

then

f(G)=Ω\originalleft(nhom⁡(G)\aftergroup\originalright).f(G)=\Omega\mathopen{}\mathclose\bgroup\originalleft(\frac{n}{\hom(G)}\aftergroup\egroup\originalright).

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 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.