Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
Brown and Alexander Sidorenko
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
I_{K_{2,2,1}}(e) has at least two local maxima in (0,1) and I_{K_t^-}(e) has a non-global local maximum for t in {5,8,11,...,74}.
citing papers explorer
-
The inducibility of 6-vertex graphs
Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
-
Local maximum of inducibility profiles
I_{K_{2,2,1}}(e) has at least two local maxima in (0,1) and I_{K_t^-}(e) has a non-global local maximum for t in {5,8,11,...,74}.