ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG and finite vertex sets T,YT,Y, say that YY is joined to two vertices of TT if every y∈Yy\in Y is adjacent to two distinct vertices u,v∈Tu,v\in T. Is it true that, for every ε>0\varepsilon>0, all sufficiently large nn, and every graph GG on nn vertices with more than n2/4n^2/4 edges, there exist a triangle TT in GG and a set YY of vertices such that every vertex of YY is adjacent to at least two vertices of TT and

(12−ε)n<∣Y∣?\left(\frac12-\varepsilon\right)n<|Y|?

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.