{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:13:14Z","timestamp":1779397994980,"version":"3.53.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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$.\r\nWe also compute the $F$-inducibility constant\u00a0(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.<\/jats:p>","DOI":"10.37236\/14612","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T20:51:23Z","timestamp":1779396683000},"source":"Crossref","is-referenced-by-count":0,"title":["Some Exact Inducibility-type Results for Graphs via Flag Algebras"],"prefix":"10.37236","volume":"33","author":[{"given":"Levente","family":"Bodn\u00e1r","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleg","family":"Pikhurko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2026,5,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p39\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T20:51:23Z","timestamp":1779396683000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i2p39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,22]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4,14]]}},"URL":"https:\/\/doi.org\/10.37236\/14612","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,22]]},"article-number":"P2.39"}}