{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:55:13Z","timestamp":1761252913610},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,7,3]],"date-time":"2014-07-03T00:00:00Z","timestamp":1404345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00493-014-2912-y","type":"journal-article","created":{"date-parts":[[2014,7,3]],"date-time":"2014-07-03T15:54:09Z","timestamp":1404402849000},"page":"379-406","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Extremal results for odd cycles in sparse pseudorandom graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Elad","family":"Aigner-Horev","sequence":"first","affiliation":[]},{"given":"Hi\u1ec7p","family":"H\u00e0n","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Schacht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,3]]},"reference":[{"key":"2912_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon: Eigenvalues and expanders, Combinatorica 6 (1986), 83\u201396; Theory of computing (Singer Island, Fla., 1984).","journal-title":"Combinatorica"},{"key":"2912_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon: Explicit Ramsey graphs and orthonormal labelings, Electron. J. Combin. 1 (1994).","DOI":"10.37236\/1192"},{"key":"2912_CR3","first-page":"253","volume":"80","author":"N. Alon","year":"1998","unstructured":"N. Alon and N. Kahale: Approximating the independence number via the v-function, Math. Programming, Ser. A 80 (1998), 253\u2013264.","journal-title":"Math. Programming, Ser. A"},{"key":"2912_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon and V. D. Milman: \u03bb1; isoperimetric inequalities for graphs, and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73\u201388.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2912_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N. Alon","year":"2008","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, third ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., Hoboken, NJ, 2008, With an appendix on the life and work of Paul Erd\u0151s.","edition":"third ed."},{"key":"2912_CR6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/jgt.3190140511","volume":"14","author":"L. Babai","year":"1990","unstructured":"L. Babai, M. Simonovits and J. Spencer: Extremal subgraphs of random graphs, J. Graph Theory 14 (1990), 599\u2013622.","journal-title":"J. Graph Theory"},{"key":"2912_CR7","volume-title":"Extremal graph theory","author":"B. Bollob\u00e1s","year":"2004","unstructured":"B. Bollob\u00e1s: Extremal graph theory, Dover Publications Inc., Mineola, NY, 2004, Reprint of the 1978 original."},{"key":"2912_CR8","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1017\/S0963548305006875","volume":"14","author":"F. K. Chung","year":"2005","unstructured":"F. K. Chung: A spectral Tur\u00e1n theorem, Combin. Probab. Comput. 14 (2005), 755\u2013767.","journal-title":"Combin. Probab. Comput."},{"key":"2912_CR9","unstructured":"D. Conlon and W. T. Gowers: Combinatorial theorems in sparse random sets, submitted."},{"key":"2912_CR10","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":"2912_CR11","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P. Erd\u00f6s","year":"1946","unstructured":"P. Erd\u00f6s 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":"2912_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jctb.1995.1035","volume":"64","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell, Y. Kohayakawa and T. \u0141uczak: Tur\u00e1n\u2019s extremal problem in random graphs: forbidding even cycles, J. Combin. Theory Ser. B 64 (1995), 273\u2013287.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2912_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01300129","volume":"16","author":"P. E. Haxell","year":"1996","unstructured":"P. E. Haxell, Y. Kohayakawa and T. \u0141uczak: Tur\u00e1n\u2019s extremal problem in random graphs: forbidding odd cycles, Combinatorica 16 (1996), 107\u2013122.","journal-title":"Combinatorica"},{"key":"2912_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"S. Janson, T. \u0141uczak and A. Rucinski: Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000."},{"key":"2912_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01200906","volume":"17","author":"Y. Kohayakawa","year":"1997","unstructured":"Y. Kohayakawa, T. \u0141uczak and V. R\u00f6dl: On K 4-free subgraphs of random graphs, Combinatorica 17 (1997), 173\u2013213.","journal-title":"Combinatorica"},{"key":"2912_CR16","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/j.jcta.2006.08.004","volume":"114","author":"Y. Kohayakawa","year":"2007","unstructured":"Y. Kohayakawa, V. R\u00f6dl, M. Schacht, P. Sissokho and J. Skokan: Tur\u00e1n\u2019s theorem for pseudo-random graphs, J. Combin. Theory Ser. A 114 (2007), 631\u2013657.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2912_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/090761148","volume":"24","author":"M. Krivelevich","year":"2010","unstructured":"M. Krivelevich, C. Lee and B. Sudakov: Resilient pancyclicity of random and pseudorandom graphs, SIAM J. Discrete Math. 24 (2010), 1\u201316.","journal-title":"SIAM J. Discrete Math."},{"key":"2912_CR18","doi-asserted-by":"crossref","unstructured":"M. Krivelevich and B. Sudakov: Pseudo-random graphs, More sets, graphs and numbers, Bolyai Soc. Math. Stud., vol. 15, Springer, Berlin, 2006.","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"2912_CR19","unstructured":"M. Schacht: Extremal results for random discrete structures, submitted."},{"key":"2912_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.20074","volume":"49","author":"B. Sudakov","year":"2005","unstructured":"B. Sudakov, T. Szab\u00f3 and V. H. Vu: A generalization of Tur\u00e1n\u2019s theorem, J. Graph Theory 49 (2005), 187\u2013195.","journal-title":"J. Graph Theory"},{"key":"2912_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"R. M. Tanner","year":"1984","unstructured":"R. M. Tanner: Explicit concentrators from generalized N-gons, SIAM J. Algebraic Discrete Methods 5 (1984), 287\u2013293.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2912_CR22","first-page":"173","volume":"123","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Random graphs, strongly regular graphs and pseudorandom graphs, Surveys in combinatorics 1987 (New Cross, 1987), London Math. Soc. Lecture Note Ser., vol. 123, Cambridge Univ. Press, Cambridge, 1987, 173\u2013195.","journal-title":"Random graphs, strongly regular graphs and pseudorandom graphs"},{"key":"2912_CR23","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"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2912-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2912-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2912-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T23:35:43Z","timestamp":1598052943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2912-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,3]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["2912"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2912-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,3]]}}}