{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T01:46:03Z","timestamp":1785894363566,"version":"3.56.0"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T00:00:00Z","timestamp":1780617600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101020255"],"award-info":[{"award-number":["101020255"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.06.003","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T16:18:46Z","timestamp":1781626726000},"page":"303-323","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Semi-inducibility of 4-vertex graphs"],"prefix":"10.1016","volume":"392","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7652-0833","authenticated-orcid":false,"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":"78","reference":[{"key":"10.1016\/j.dam.2026.06.003_b1","article-title":"Sum of squares of degrees in a graph","volume":"10","author":"\u00c1brego","year":"2009","journal-title":"JIPAM. J. Inequal. Pure Appl. Math."},{"key":"10.1016\/j.dam.2026.06.003_b2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01902206","article-title":"Graphs with maximal number of adjacent pairs of edges","volume":"32","author":"Ahlswede","year":"1978","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.dam.2026.06.003_b3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s004930070001","article-title":"Efficient testing of large graphs","volume":"20","author":"Alon","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2026.06.003_b4","series-title":"An Introduction to Diophantine Equations","author":"Andreescu","year":"2010"},{"key":"10.1016\/j.dam.2026.06.003_b5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0963548310000222","article-title":"Hypergraphs do jump","volume":"20","author":"Baber","year":"2011","journal-title":"Comb.\u00a0Probab.\u00a0Comput."},{"key":"10.1016\/j.dam.2026.06.003_b6","series-title":"Semi-inducibility of some small graphs","author":"Balogh","year":"2026"},{"key":"10.1016\/j.dam.2026.06.003_b7","series-title":"The semi-inducibility problem","author":"Basit","year":"2025"},{"key":"10.1016\/j.dam.2026.06.003_b8","series-title":"FlagAlgebraToolbox: Flag Algebra Computations in SageMath","author":"Bodn\u00e1r","year":"2026"},{"key":"10.1016\/j.dam.2026.06.003_b9","article-title":"Some exact inducibility-type results for graphs via flag algebras","volume":"33","author":"Bodn\u00e1r","year":"2026","journal-title":"Electr. J. Comb."},{"key":"10.1016\/j.dam.2026.06.003_b10","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1002\/jgt.3190180610","article-title":"The inducibility of complete bipartite graphs","volume":"18","author":"Brown","year":"1994","journal-title":"J.\u00a0Graph Theory"},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.06.003_b11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0012-365X(98)00195-2","article-title":"Two path extremal graphs and an application to a Ramsey-type problem","volume":"196","author":"Byer","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.003_b12","first-page":"193","article-title":"Flag algebras: a first glance","volume":"17","author":"de\u00a0Carli\u00a0Silva","year":"2016","journal-title":"Nieuw Arch. Wiskd. (5)"},{"key":"10.1016\/j.dam.2026.06.003_b13","series-title":"Maximizing alternating paths via entropy","author":"Chen","year":"2025"},{"key":"10.1016\/j.dam.2026.06.003_b14","series-title":"On alternating 6-cycles in edge-coloured graphs","author":"Chen","year":"2025"},{"key":"10.1016\/j.dam.2026.06.003_b15","first-page":"283","article-title":"On bipartite subgraphs of graphs","volume":"18","author":"Erd\u0151s","year":"1967","journal-title":"Mat.\u00a0Lapok"},{"key":"10.1016\/j.dam.2026.06.003_b16","first-page":"264","article-title":"Graphs with prescribed degree of vertices","volume":"11","author":"Erd\u0151s","year":"1960","journal-title":"Mat.\u00a0Lapok"},{"key":"10.1016\/j.dam.2026.06.003_b17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.jctb.2015.05.001","article-title":"A proof of the stability of extremal graphs, Simonovits\u2019 stability from Szemer\u00e9di\u2019s regularity","volume":"115","author":"F\u00fcredi","year":"2015","journal-title":"J.\u00a0Comb.\u00a0Theory\u00a0(B)"},{"key":"10.1016\/j.dam.2026.06.003_b18","doi-asserted-by":"crossref","DOI":"10.37236\/10694","article-title":"On the local structure of oriented graphs\u2014a case study in flag algebras","volume":"29","author":"Gilboa","year":"2022","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.06.003_b19","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1112\/jlms.12777","article-title":"Stability from graph symmetrisation arguments with applications to inducibility","volume":"108","author":"Liu","year":"2023","journal-title":"J. Lond. Math. Soc. (2)"},{"key":"10.1016\/j.dam.2026.06.003_b20","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.jcta.2016.09.003","article-title":"Tur\u00e1n number of generalized triangles","volume":"146","author":"Norin","year":"2017","journal-title":"J.\u00a0Comb.\u00a0Theory\u00a0(A)"},{"key":"10.1016\/j.dam.2026.06.003_b21","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/j.jcta.2017.08.004","article-title":"Tur\u00e1n numbers of extensions","volume":"155","author":"Norin","year":"2018","journal-title":"J.\u00a0Comb.\u00a0Theory\u00a0(A)"},{"key":"10.1016\/j.dam.2026.06.003_b22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<283::AID-JGT3>3.0.CO;2-H","article-title":"(n,e)-graphs with maximum sum of squares of degrees","volume":"31","author":"Peled","year":"1999","journal-title":"J.\u00a0Graph Theory"},{"key":"10.1016\/j.dam.2026.06.003_b23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.jctb.2018.08.001","article-title":"Strong forms of stability from flag algebra calculations","volume":"135","author":"Pikhurko","year":"2019","journal-title":"J.\u00a0Comb.\u00a0Theory\u00a0(B)"},{"key":"10.1016\/j.dam.2026.06.003_b24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(75)90084-2","article-title":"The inducibility of graphs","volume":"19","author":"Pippenger","year":"1975","journal-title":"J.\u00a0Comb.\u00a0Theory\u00a0(B)"},{"key":"10.1016\/j.dam.2026.06.003_b25","first-page":"1239","article-title":"Flag algebras","volume":"72","author":"Razborov","year":"2007","journal-title":"J.\u00a0Symb.\u00a0Log."},{"key":"10.1016\/j.dam.2026.06.003_b26","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/090747476","article-title":"On 3-hypergraphs with forbidden 4-vertex configurations","volume":"24","author":"Razborov","year":"2010","journal-title":"SIAM J.\u00a0Discr.\u00a0Math."},{"key":"10.1016\/j.dam.2026.06.003_b27","first-page":"27","article-title":"Stability results for graphs with a critical edge","volume":"74","author":"Roberts","year":"2018","journal-title":"Eur.\u00a0J.\u00a0Comb."},{"key":"10.1016\/j.dam.2026.06.003_b28","series-title":"Theory of Graphs (Proc.\u00a0Colloq., Tihany, 1966)","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003276?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003276?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T01:00:37Z","timestamp":1785891637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":28,"alternative-id":["S0166218X26003276"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.003","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Semi-inducibility of 4-vertex graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}