Every K4-free graph on n vertices has balanced bipartite distance at most n²/9.
An Introduction to Razbo- rov’s Flag Algebra as a Proof System for Extremal Graph Theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Balanced bipartite distance of $K_4$-free graphs
Every K4-free graph on n vertices has balanced bipartite distance at most n²/9.