ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K\NNK_\NN be the complete graph on the positive integers, and define the upper density of a vertex set A⊆\NNA\subseteq\NN by dˉ(A)=lim sup⁡n→∞∣A∩[n]∣/n\bar d(A)=\limsup_{n\to\infty}|A\cap[n]|/n. The upper density of a path is the upper density of its vertex set. The 8/9-density conjecture. Every 22-coloring of K\NNK_\NN contains a monochromatic path of upper density at least 8/98/9. The bound would be best possible by the example cited in the source.

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.