Some Exact Inducibility-type Results for Graphs via Flag Algebras
The Electronic Journal of Combinatorics · 22.05.2026 · 33 (2)
DOI: 10.37236/14612 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 22.05.2026. Verfasst von Levente Bodnár und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The $(\kappa,\ell)$-edge-inducibility problem asks for the maximum number of $\kappa$-subsets inducing exactly $\ell$ edges that a graph of given order $n$ can have. Using flag algebras and stability approach, we resolve this problem for all sufficiently large $n$ (including a description of all extremal and almost extremal graphs) in eleven new non-trivial cases when $\kappa\le 7$. We also compute the $F$-inducibility constant (the asymptotically maximum density of induced copies of $F$ in a graph of given order $n$) and obtain some corresponding structure results for three new graphs $F$ with $5$ vertices: the 3-edge star plus an isolated vertex, the 4-cycle plus an isolated vertex, and the 4-cycle with a pendant edge.
Zitieren
APA
Bodnár, L., & Pikhurko, O. (2026). Some Exact Inducibility-type Results for Graphs via Flag Algebras. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14612
Vancouver
Bodnár L, Pikhurko O. Some Exact Inducibility-type Results for Graphs via Flag Algebras. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14612
BibTeX
@article{Bodnr2026,
author = {Bodnár, Levente and Pikhurko, Oleg},
title = {Some Exact Inducibility-type Results for Graphs via Flag Algebras},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14612}
}
EUVIMED