Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
A proof of the stability of extremal graphs
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
π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.
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.
-
A note on the $t$-partite link problem of F\"uredi
π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.