Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
An Introduction to Razbo- rov’s Flag Algebra as a Proof System for Extremal Graph Theory
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
Every K4-free graph on n vertices has balanced bipartite distance at most n²/9.
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.