{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:17:49Z","timestamp":1769764669318,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Arastirma Kurumu","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01123-z","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T01:03:15Z","timestamp":1713229395000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum size of a triangle-free graph with bounded maximum degree and matching number"],"prefix":"10.1007","volume":"47","author":[{"given":"Milad","family":"Ahanjideh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1171-9294","authenticated-orcid":false,"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[]},{"given":"Mehmet Akif","family":"Y\u0131ld\u0131z","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"key":"1123_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","volume":"8","author":"B Andr\u00e1sfai","year":"1974","unstructured":"Andr\u00e1sfai B, Erd\u00f6s P, S\u00f3s VT (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math 8:205\u2013218","journal-title":"Discrete Math"},{"key":"1123_CR2","doi-asserted-by":"publisher","first-page":"4176","DOI":"10.1016\/j.disc.2008.10.007","volume":"309","author":"N Balachandran","year":"2009","unstructured":"Balachandran N, Khare N (2009) Graphs with restricted valency and matching number. Discrete Math 309:4176\u20134180","journal-title":"Discrete Math"},{"key":"1123_CR3","doi-asserted-by":"publisher","unstructured":"Banak AE, Ekim T, Ta\u015fk\u0131n ZC (2023) Constructing extremal triangle-free graphs using integer programming. Discrete Optim 50:100802. https:\/\/doi.org\/10.1016\/j.disopt.2023.100802","DOI":"10.1016\/j.disopt.2023.100802"},{"key":"1123_CR4","doi-asserted-by":"crossref","unstructured":"Belmonte R, Heggernes P, van \u2019t Hof P, Saei R (2012) Ramsey numbers for line graphs and perfect graphs, In: COCOON \u201912, pp 204\u2013215","DOI":"10.1007\/978-3-642-32241-9_18"},{"key":"1123_CR5","doi-asserted-by":"crossref","unstructured":"Blair JRS, Heggernes P, Lima PT, Lokshtanov D (2020) On the maximum number of edges in chordal graphs of bounded degree and matching number, In: Latin American symposium on theoretical informatics, pp 600\u2013612. Springer, Cham","DOI":"10.1007\/978-3-030-61792-9_47"},{"key":"1123_CR6","first-page":"120","volume-title":"Modern graph theory, graduate texts in mathematics 184","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory, graduate texts in mathematics 184. Springer, New York, p 120"},{"key":"1123_CR7","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0095-8956(76)90004-6","volume":"20","author":"V Chv\u00e1tal","year":"1976","unstructured":"Chv\u00e1tal V, Hanson D (1976) Degrees and matchings. J Combin Theory Ser B 20:128\u2013138","journal-title":"J Combin Theory Ser B"},{"key":"1123_CR8","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.disc.2017.01.010","volume":"340","author":"C Dibek","year":"2017","unstructured":"Dibek C, Ekim T, Heggernes P (2017) Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discrete Math 340:927\u2013934","journal-title":"Discrete Math"},{"key":"1123_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, Rado R (1960) Intersection theorems for systems of sets. J Lond Math Soc 35:85\u201390","journal-title":"J Lond Math Soc"},{"key":"1123_CR10","first-page":"135","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai T (1963) Neuer Beweis eines Tutte\u2019schen Satzes, Magyar Tud. Akad Mat Kutat\u00f3 Int K\u00f6zl 8:135\u2013139","journal-title":"Akad Mat Kutat\u00f3 Int K\u00f6zl"},{"key":"1123_CR11","doi-asserted-by":"crossref","unstructured":"H\u00e4ggkvist R (1982) Odd cycles of specified length in nonbipartite graphs. In: Graph theory (Cambridge, 1981), vol 62 of North-Holland Mathematics Studies, North-Holland, pp 89\u201399","DOI":"10.1016\/S0304-0208(08)73552-7"},{"key":"1123_CR12","volume-title":"Maximum number of edges in graph classes under degree and matching constraints","author":"E M\u00e5land","year":"2015","unstructured":"M\u00e5land E (2015) Maximum number of edges in graph classes under degree and matching constraints. The University of Bergen, Norway"},{"key":"1123_CR13","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) On an extremal problem in graph theory. Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"},{"key":"1123_CR14","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a p-graph, (Russian). Diskret Analiz 3:25\u201330","journal-title":"Diskret Analiz"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01123-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:09:38Z","timestamp":1715951378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01123-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,16]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01123-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,16]]},"assertion":[{"value":"1 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"57"}}