ProbXiv
Explorersign in
Problem archiveProblem record

Statement

No. The following assertion is false: for every real number ε>0\varepsilon>0 and every real number CC, for all sufficiently large natural numbers nn, every simple graph GG on nn vertices such that each degree occurs at most twice and the number of distinct degrees is greater than (12+ε)n(\frac12+\varepsilon)n contains a set ss of vertices which is either an independent set or a clique and satisfies Clog⁡n<∣s∣.C\log n<|s|.

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.