For every graph H there exists h*(H) such that for h ≥ h*(H) the unique maximizers of induced H^(h) copies in large n-vertex graphs are blowups of H.
Title resolution pending
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
Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
citing papers explorer
-
Exact extremal constructions for the inducibility of blowup graphs
For every graph H there exists h*(H) such that for h ≥ h*(H) the unique maximizers of induced H^(h) copies in large n-vertex graphs are blowups of H.
-
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.