ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer r≥2r\ge 2 and a real number 0<δ<1/r0<\delta<1/r, let bn(r,δ)b_n(r,\delta) be the largest integer bb such that every graph GG on nn vertices satisfying e(G)≥(1−1/r+δ)(n2)e(G)\geq (1-1/r+\delta)\binom{n}{2} contains a copy of the balanced complete (r+1)(r+1)-partite graph Kr+1(b)K_{r+1}(b), with bb vertices in each part. Determine the asymptotic order of bn(r,δ)b_n(r,\delta) as n→∞n\to\infty. The cited preprint claims that, for every fixed rr and δ\delta in this range, bn(r,δ)=Θ ⁣(log⁡n(1/r−δ)rlog⁡(1/δ))b_n(r,\delta)=\Theta\!\left(\frac{\log n}{(1/r-\delta)r\log(1/\delta)}\right), completing the bound for all edge densities; this claim is presently unverified.

Record

Added
Links

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.