The conjecture on unboundedly many local maxima of inducibility profiles
Let be the family of complete multipartite graphs, and let denote the inducibility profile of a graph . Unbounded-local-maxima conjecture. For every , there is a graph such that has at least local maxima.
The theorem preceding this conjecture establishes strict non-global local maxima for for the listed values of , and the paper's first example gives a graph with at least two local maxima. The conjecture asks whether complete multipartite graphs can realize arbitrarily many local maxima.
References
- József Balogh, Bernard Lidický and Haoran Luo, “Local maximum of inducibility profiles”, arXiv:2605.15021 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.