Introduces spectral inducibility of graphs and proves a multipartite reduction for the extremal graphs when the target graph F is complete multipartite, with the leading asymptotic equal to ordinary inducibility.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
citing papers explorer
-
The spectral inducibility of graphs
Introduces spectral inducibility of graphs and proves a multipartite reduction for the extremal graphs when the target graph F is complete multipartite, with the leading asymptotic equal to ordinary inducibility.
- The inducibility of 6-vertex graphs