{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:55:36Z","timestamp":1760385336526},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00493-013-2863-8","type":"journal-article","created":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T06:40:09Z","timestamp":1389768009000},"page":"699-732","source":"Crossref","is-referenced-by-count":11,"title":["On a conjecture of Erd\u0151s and Simonovits: Even cycles"],"prefix":"10.1007","volume":"33","author":[{"given":"Peter","family":"Keevash","sequence":"first","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Verstra\u00ebte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,16]]},"reference":[{"key":"2863_CR1","doi-asserted-by":"crossref","first-page":"R21","DOI":"10.37236\/293","volume":"17","author":"P Allen","year":"2010","unstructured":"P. Allen: Dense H-free graphs are almost (\u03c7(H)\u22121)-partite, Electronic Journal of Combinatorics 17 (2010), R21.","journal-title":"Electronic Journal of Combinatorics"},{"key":"2863_CR2","unstructured":"P. Allen, J. B\u00f6ttcher, S. Griffiths, Y. Kohayakawa and R. Morris: The chromatic thresholds of graphs, arXiv:1108.1746."},{"key":"2863_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N Alon","year":"2002","unstructured":"N. Alon, S. Hoory and N. Linial: The Moore bound for irregular graphs, Graphs Combin. 18 (2002), 53\u201357.","journal-title":"Graphs Combin."},{"key":"2863_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"N. Alon and J. Spencer: The Probabilistic Method, 3rd edition, Wiley, New York, 2008.","edition":"3rd edition"},{"key":"2863_CR5","unstructured":"N. Alon and B. Sudakov: H-free graphs of large minimum degree, Electron. J. Combin. 13 (2006), Research Paper 19, 9."},{"key":"2863_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","volume":"8","author":"B Andr\u00e1sfai","year":"1974","unstructured":"B. Andr\u00e1sfai, P. Erd\u0151s and V. S\u00f3s: On the connection between chromatic number, maximal clique and minimal degree of a graph, Disc. Math. 8 (1974), 205\u2013218.","journal-title":"Disc. Math."},{"key":"2863_CR7","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.4153\/CJM-1966-109-8","volume":"18","author":"CT Benson","year":"1966","unstructured":"C.T. Benson: Minimal regular graphs of girths eight and twelve, Canad. J. Math. 18 (1966), 1091\u20131094.","journal-title":"Canad. J. Math."},{"key":"2863_CR8","first-page":"1244","volume":"16","author":"G R Blakley","year":"1965","unstructured":"G. R. Blakley and P. Roy: A H\u00f6lder type inequality for symmetric matrices with nonnegative entries, Proc. Amer. Math. Soc. 16 (1965), 1244\u20131245.","journal-title":"Proc. Amer. Math. Soc."},{"key":"2863_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J Bondy","year":"1974","unstructured":"J. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combin. Theory Ser. B 16 (1974), 75\u2013105.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2863_CR10","first-page":"74","volume":"2","author":"P Erd\u0151s","year":"1938","unstructured":"P. Erd\u0151s: On sequences of integers no one of which divides the product of two others and on some related problems, Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk 2 (1938), 74\u201382.","journal-title":"Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk"},{"key":"2863_CR11","first-page":"3","volume":"14","author":"P P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s, P: Some recent progress on extremal problems in graph theory, Congr. Numer. 14 (1975), 3\u201314.","journal-title":"Congr. Numer."},{"key":"2863_CR12","first-page":"623","volume":"7A","author":"P Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s and A. R\u00e9nyi: On a problem in the theory of graphs, Publ. Math. Inst. Hungar. Acad. Sci. 7A (1962), 623\u2013641.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"2863_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P Erd\u0151s","year":"1982","unstructured":"P. Erd\u0151s and M. Simonovits: Compactness results in extremal graph theory, Combinatorica 2 (1982), 275\u2013288.","journal-title":"Combinatorica"},{"key":"2863_CR14","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966), 51\u201357.","journal-title":"Studia Sci. Math. Hungar."},{"key":"2863_CR15","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s and A. H. Stone: On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087\u20131091.","journal-title":"Bull. Amer. Math. Soc."},{"key":"2863_CR16","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0021-8693(64)90028-6","volume":"1","author":"W Feit","year":"1964","unstructured":"W. Feit and G. Higman: The nonexistence of certain generalized polygons, J. Algebra 1 (1964), 114\u2013131.","journal-title":"J. Algebra"},{"key":"2863_CR17","volume-title":"Quadrilateral-free graphs with maximum number of edges","author":"Z F\u00fcredi","year":"1988","unstructured":"Z. F\u00fcredi: Quadrilateral-free graphs with maximum number of edges, unpublished manuscript (1988)."},{"key":"2863_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0052","volume":"68","author":"Z F\u00fcredi","year":"1996","unstructured":"Z. F\u00fcredi: On the number of edges of quadrilateral-free graphs, J. Combin. Theory Ser. B 68 (1996), 1\u20136.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2863_CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/jcta.1996.0067","volume":"75","author":"Z F\u00fcredi","year":"1996","unstructured":"Z. F\u00fcredi: New asymptotics for bipartite Tur\u00e1n numbers, J. Combin. Theory Ser. A 75 (1996), 141\u2013144.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2863_CR20","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/j.aim.2005.04.011","volume":"203","author":"Z F\u00fcredi","year":"2006","unstructured":"Z. F\u00fcredi, A. Naor and J. Verstra\u00ebte: On the Tur\u00e1n number for the hexagon, Adv. Math. 203 (2006), 476\u2013496.","journal-title":"Adv. Math."},{"key":"2863_CR21","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.20505","volume":"66","author":"W Goddard","year":"2011","unstructured":"W. Goddard and J. Lyle: Dense graphs with small clique number, J. Graph Theory 66 (2011), 319\u2013331.","journal-title":"J. Graph Theory"},{"key":"2863_CR22","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.jctb.2007.10.007","volume":"98","author":"C D Godsil","year":"2008","unstructured":"C. D. Godsil and M. W. Newman: Eigenvalue bounds for independent sets, J. Combin. Theory Ser. B 98 (2008), 721\u2013734.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2863_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jctb.2002.2123","volume":"86","author":"S Hoory","year":"2002","unstructured":"S. Hoory: The size of bipartite graphs with a given girth, J. Combin. Theory Ser. B 86 (2002), 215\u2013220.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2863_CR24","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50\u201357.","journal-title":"Colloquium Math."},{"key":"2863_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume":"15","author":"M Krivelevich","year":"2006","unstructured":"M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More Sets, Graphs and Numbers, Bolyai Soc. Math. Studies 15, Springer (2006), 199\u2013262.","journal-title":"More Sets, Graphs and Numbers"},{"key":"2863_CR26","doi-asserted-by":"crossref","first-page":"N5","DOI":"10.37236\/1972","volume":"12","author":"T Lam","year":"2005","unstructured":"T. Lam and J. Verstra\u00ebte: A note on graphs without short even cycles, Electron. J. Combin. 12 (2005), N5.","journal-title":"Electron. J. Combin."},{"key":"2863_CR27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F Lazebnik","year":"1995","unstructured":"F. Lazebnik, V. A. Ustimenko and A. J. Woldar: A new series of dense graphs of high girth, Bulletin of the AMS 32 (1995), 73\u201379.","journal-title":"Bulletin of the AMS"},{"key":"2863_CR28","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0012-365X(98)00258-1","volume":"197\/198","author":"F Lazebnik","year":"1999","unstructured":"F. Lazebnik, V.A. Ustimenko and A.J. Woldar: Polarities and 2k-cycle-free graphs, Disc. Math. 197\/198 (1999), 503\u2013513.","journal-title":"Disc. Math."},{"key":"2863_CR29","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs, Combinatorica 8 (1988), 261\u2013277.","journal-title":"Combinatorica"},{"key":"2863_CR30","unstructured":"T. Luczak and S. Thomass\u00e9: Coloring dense graphs via VC-dimension, preprint."},{"key":"2863_CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"G Margulis","year":"1982","unstructured":"G. Margulis: Explicit constructions of graphs without short cycles and low density codes, Combinatorica 2 (1982), 71\u201378.","journal-title":"Combinatorica"},{"key":"2863_CR32","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1017\/S0963548305007029","volume":"14","author":"A Naor","year":"2005","unstructured":"A. Naor and J. Verstra\u00ebte: A note on bipartite graphs without 2k-cycles, Combin. Probab. Comput. 14 (2005), 845\u2013849.","journal-title":"Combin. Probab. Comput."},{"key":"2863_CR33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01836217","volume":"14","author":"T D Parsons","year":"1976","unstructured":"T. D. Parsons: Graphs from projective planes, Aequationes Math. 14 (1976), 167\u2013189.","journal-title":"Aequationes Math."},{"key":"2863_CR34","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1958","unstructured":"I. Reiman: \u00dcber ein Problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958), 269\u2013278.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2863_CR35","first-page":"72","volume":"46","author":"A Sidorenko","year":"1989","unstructured":"A. Sidorenko: Cycles in graphs and functional inequalities, Mat. Zametki 46 (1989), 72\u201379; translation in Math. Notes 46 (1989), 877\u2013882.","journal-title":"Mat. Zametki"},{"key":"2863_CR36","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0021-9800(66)80054-6","volume":"1","author":"R Singleton","year":"1966","unstructured":"R. Singleton: On minimal graphs of maximum even girth, J. Combin. Theory 1 (1966), 306\u2013332.","journal-title":"J. Combin. Theory"},{"key":"2863_CR37","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C Thomassen","year":"2007","unstructured":"C. Thomassen: On the chromatic number of pentagon-free graphs of large minimum degree, Combinatorica 27 (2007), 241\u2013243.","journal-title":"Combinatorica"},{"key":"2863_CR38","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02684706","volume":"2","author":"J Tits","year":"1959","unstructured":"J. Tits: Sur la trialit\u00e9 et certains groupes qui s\u2019en d\u00e9duisent, Inst. Hautes \u00c9tudes Sci. Publ. Math. 2 (1959), 13\u201360.","journal-title":"Inst. Hautes \u00c9tudes Sci. Publ. Math."},{"key":"2863_CR39","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok 48 (1941), 436\u2013452.","journal-title":"Mat. Fiz. Lapok"},{"key":"2863_CR40","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S0963548300004478","volume":"9","author":"J Verstra\u00ebte","year":"2000","unstructured":"J. Verstra\u00ebte: On arithmetic progressions of cycle lengths in graphs, Combin. Probab. Comput. 9 (2000), 369\u2013373.","journal-title":"Combin. Probab. Comput."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2863-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2863-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2863-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T05:13:18Z","timestamp":1597381998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2863-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["2863"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2863-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}