Sparse halves in K₄-free graphs
Reviewed by Pithpith:2WUORJKJopen to challenge →
classification
math.CO
keywords
conjecturefreegraphschungcontainsedgeseveryfirst
read the original abstract
A conjecture of Chung and Graham states that every $K_4$-free graph on $n$ vertices contains a vertex set of size $\lfloor n/2 \rfloor$ that spans at most $n^2/18$ edges. We make the first step toward this conjecture by showing that it holds for all regular graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.