ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Does there exist a real constant c>0c>0 such that, for all sufficiently large integers nn, every graph GG on nn vertices with at least (1/8−c)n2(1/8-c)n^2 edges contains either a copy of K4K_4 or an independent set of size at least n/log⁡nn/\log n? Equivalently, does there exist c>0c>0 such that rt⁡(n;4,n/log⁡n)<(1/8−c)n2\operatorname{rt}(n;4,n/\log n)<(1/8-c)n^2 for all sufficiently large nn?

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.