{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T08:14:56Z","timestamp":1783584896009,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003827","name":"National Research Development and Innovation Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003827","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,11]]},"DOI":"10.1016\/j.dam.2026.06.015","type":"journal-article","created":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:44:35Z","timestamp":1782315875000},"page":"50-72","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generalized planar Tur\u00e1n numbers related to short cycles"],"prefix":"10.1016","volume":"393","author":[{"given":"Ervin","family":"Gy\u0151ri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4350-0077","authenticated-orcid":false,"given":"Hilal","family":"Hama Karim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.06.015_b1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","article-title":"Many T copies in H-free graphs","volume":"121","author":"Alon","year":"2016","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.06.015_b2","doi-asserted-by":"crossref","first-page":"4332","DOI":"10.1016\/j.disc.2007.08.016","article-title":"Pentagons vs. triangles","volume":"308","author":"Bollob\u00e1s","year":"2008","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b3","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.22838","article-title":"Counting paths, cycles, and blow-ups in planar graphs","volume":"101","author":"Cox","year":"2022","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/jgt.21991","article-title":"Extremal C4-free\/C5-free planar graphs","volume":"83","author":"Dowden","year":"2016","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.015_b5","first-page":"459","article-title":"On the number of complete subgraphs contained in certain graphs","volume":"7","author":"Erd\u0151s","year":"1962","journal-title":"Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl"},{"key":"10.1016\/j.dam.2026.06.015_b6","series-title":"Graph Theory and Combinatorics (Cambridge, 1983)","first-page":"1","article-title":"On some problems in graph theory, combinatorial analysis and combinatorial number theory","author":"Erd\u0151s","year":"1984"},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/jgt.22745","article-title":"The maximum number of induced C5\u2019s in a planar graph","volume":"99","author":"Ghosh","year":"2022","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b8","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1137\/21M140657X","article-title":"Planar Tur\u00e1n number of the 6-cycle","volume":"36","author":"Ghosh","year":"2022","journal-title":"SIAM J. Discret. Math"},{"issue":"5","key":"10.1016\/j.dam.2026.06.015_b9","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/j.jctb.2012.04.001","article-title":"On the maximum number of five-cycles in a triangle-free graph","volume":"102","author":"Grzesik","year":"2012","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.dam.2026.06.015_b10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02122689","article-title":"On the number of C5\u2019s in a triangle-free graph","volume":"9","author":"Gy\u0151ri","year":"1989","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.dam.2026.06.015_b11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01789461","article-title":"On the maximal number of certain subgraphs in Kr-free graphs","volume":"7","author":"Gy\u0151ri","year":"1991","journal-title":"Graphs Combin."},{"issue":"4","key":"10.1016\/j.dam.2026.06.015_b12","article-title":"Generalized planar Tur\u00e1n numbers","volume":"28","author":"Gy\u0151ri","year":"2021","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.dam.2026.06.015_b13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/jgt.23172","article-title":"The maximum number of pentagons in a planar graph","volume":"108","author":"Gy\u0151ri","year":"2025","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.015_b14","series-title":"Extremal planar graphs with no cycles of particular lengths","author":"Gy\u0151ri","year":"2022"},{"issue":"1","key":"10.1016\/j.dam.2026.06.015_b15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.3190030108","article-title":"On the number of cycles of length k in a maximal planar graph","volume":"3","author":"Hakimi","year":"1979","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b16","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.jcta.2012.12.008","article-title":"On the number of pentagons in triangle-free graphs","volume":"120","author":"Hatami","year":"2013","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.dam.2026.06.015_b17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jctb.2024.01.005","article-title":"The maximum number of copies of an even cycle in a planar graph","volume":"167","author":"Lv","year":"2024","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.dam.2026.06.015_b18","article-title":"Planar graphs with the maximum number of induced 6-cycles","volume":"30","author":"Savery","year":"2023","journal-title":"Electron. J. Comb."},{"issue":"3","key":"10.1016\/j.dam.2026.06.015_b19","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-024-02773-w","article-title":"Planar graphs with the maximum number of induced 4-cycles or 5-cycles","volume":"40","author":"Savery","year":"2024","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.06.015_b20","first-page":"436","article-title":"Egy gr\u00e1felm\u00e9leti sz\u00e9ls\u0151\u00e9rt\u00e9kfeladatr\u00f3l","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"issue":"2","key":"10.1016\/j.dam.2026.06.015_b21","first-page":"163","article-title":"On some properties of linear complexes","volume":"66","author":"Zykov","year":"1949","journal-title":"Mat. Sb."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600346X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600346X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T07:28:01Z","timestamp":1783582081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600346X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":21,"alternative-id":["S0166218X2600346X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized planar Tur\u00e1n numbers related to short cycles","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}