ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For δ>0\delta>0, let ρ(3,7,δ)\rho(3,7,\delta) be the limiting maximum edge density of an nn-vertex graph with independence number at most δn\delta n that admits a red/blue coloring with no red K3K_3 and no blue K7K_7. The (K3,K7)(K_3,K_7) density conjecture. For sufficiently small δ>0\delta>0,

ρ(3,7,δ)=716+δ2.\rho(3,7,\delta)=\frac{7}{16}+\frac{\delta}{2}.

The source gives a construction proving the corresponding lower bound. The conjecture is the assertion that this construction is asymptotically optimal for sufficiently small δ\delta.

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.