{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:59:36Z","timestamp":1740106776665,"version":"3.37.3"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF, USA","doi-asserted-by":"publisher","award":["DMS-1764123"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Arnold O. Beckman Research Award (UIUC) Campus Research Board 18132, USA","award":["#522400"]},{"name":"Langan Scholar Fund (UIUC), USA"},{"DOI":"10.13039\/100000893","name":"Simons Foundation, USA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1016\/j.ejc.2020.103200","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T11:40:56Z","timestamp":1598355656000},"page":"103200","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["An analogue of the Erd\u0151s\u2013Gallai theorem for random graphs"],"prefix":"10.1016","volume":"91","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Dudek","sequence":"additional","affiliation":[]},{"given":"Lina","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","article-title":"The longest path in a random graph","volume":"1","author":"Ajtai","year":"1981","journal-title":"Combinatorica"},{"issue":"5","key":"10.1016\/j.ejc.2020.103200_b2","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/jgt.3190140511","article-title":"Extremal subgraphs of random graphs","volume":"14","author":"Babai","year":"1990","journal-title":"J. Graph Theory"},{"year":"2019","series-title":"New lower bounds on the size-Ramsey number of a path","author":"Bal","key":"10.1016\/j.ejc.2020.103200_b3"},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b4","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1090\/S0894-0347-2014-00816-X","article-title":"Independent sets in hypergraphs","volume":"28","author":"Balogh","year":"2015","journal-title":"J. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/jgt.3190070115","article-title":"On size Ramsey number of paths, trees, and circuits. I","volume":"7","author":"Beck","year":"1983","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b6","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.jctb.2011.10.002","article-title":"The size Ramsey number of a directed path","volume":"102","author":"Ben-Eliezer","year":"2012","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20132","key":"10.1016\/j.ejc.2020.103200_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20343","article-title":"Ramsey games with giants","volume":"38","author":"Bohman","year":"2011","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.ejc.2020.103200_b8","unstructured":"B. Bollob\u00e1s, The evolution of sparse graphs, in: Graph Theory and Combinatorics, Proceedings Cambridge Combinatorial Conference in Honour of Paul Erd\u0151s, 1984, pp. 335\u2013357."},{"issue":"2","key":"10.1016\/j.ejc.2020.103200_b9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4007\/annals.2016.184.2.2","article-title":"Combinatorial theorems in sparse random sets","volume":"184","author":"Conlon","year":"2016","journal-title":"Ann. of Math. (2)"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b10","doi-asserted-by":"crossref","DOI":"10.37236\/756","article-title":"On the resilience of long cycles in random graphs","volume":"15","author":"Dellamonica","year":"2008","journal-title":"Electron. J. Combin."},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b11","doi-asserted-by":"crossref","first-page":"2079","DOI":"10.1137\/16M1069717","article-title":"On some multicolor Ramsey properties of random graphs","volume":"31","author":"Dudek","year":"2017","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b12","doi-asserted-by":"crossref","DOI":"10.37236\/7954","article-title":"Note on the multicolour size-Ramsey number for paths","volume":"25","author":"Dudek","year":"2018","journal-title":"Electron. J. Combin."},{"issue":"1\u20132","key":"10.1016\/j.ejc.2020.103200_b13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02018930","article-title":"The size Ramsey number","volume":"9","author":"Erd\u0151s","year":"1978","journal-title":"Period. Math. Hungar."},{"issue":"3\u20134","key":"10.1016\/j.ejc.2020.103200_b14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Hungar."},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01788087","article-title":"Large triangle-free subgraphs in graphs without K4","volume":"2","author":"Frankl","year":"1986","journal-title":"Graphs Combin."},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(86)90171-8","article-title":"On large matchings and cycles in sparse random graphs","volume":"59","author":"Frieze","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2020.103200_b17","first-page":"62","article-title":"Partition coverings and blocking sets in hypergraphs","volume":"71","author":"Gy\u00e1rf\u00e1s","year":"1977","journal-title":"Commun. Comput. Autom. Inst. Hungar. Acad. Sci."},{"issue":"2","key":"10.1016\/j.ejc.2020.103200_b18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jctb.1995.1035","article-title":"Tur\u00e1n\u2019s extremal problem in random graphs: Forbidding even cycles","volume":"64","author":"Haxell","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01300129","article-title":"Tur\u00e1n\u2019s extremal problem in random graphs: Forbidding odd cycles","volume":"16","author":"Haxell","year":"1996","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20224","article-title":"Factors in random graphs","volume":"33","author":"Johansson","year":"2008","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/PL00009804","article-title":"An extremal problem for random graphs and the number of graphs with large even-girth","volume":"18","author":"Kohayakawa","year":"1998","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.ejc.2020.103200_b22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01200906","article-title":"On K4-free subgraphs of random graphs","volume":"17","author":"Kohayakawa","year":"1997","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0963548303005856","article-title":"The Tur\u00e1n theorem for random graphs","volume":"13","author":"Kohayakawa","year":"2004","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b24","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distribution for the existence of Hamiltonian cycles in a random graph","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2020.103200_b25","series-title":"Surveys in Combinatorics 2019","first-page":"115","article-title":"Expanders\u2014how to find them, and what to find in them","volume":"vol. 456","author":"Krivelevich","year":"2019"},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00493-017-3701-1","article-title":"Long cycles in locally expanding graphs, with applications","volume":"39","author":"Krivelevich","year":"2019","journal-title":"Combinatorica"},{"year":"2019","series-title":"Tur\u00e1n-type problems for long cycles in random and pseudo-random graphs","author":"Krivelevich","key":"10.1016\/j.ejc.2020.103200_b27"},{"issue":"11","key":"10.1016\/j.ejc.2020.103200_b28","doi-asserted-by":"crossref","first-page":"3687","DOI":"10.1090\/S0002-9939-2012-11274-2","article-title":"A note on the Tur\u00e1n function of even cycles","volume":"140","author":"Pikhurko","year":"2012","journal-title":"Proc. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b29","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s00222-014-0562-8","article-title":"Hypergraph containers","volume":"201","author":"Saxton","year":"2015","journal-title":"Invent. Math."},{"key":"10.1016\/j.ejc.2020.103200_b30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.4007\/annals.2016.184.2.1","article-title":"Extremal results for random discrete structures","author":"Schacht","year":"2016","journal-title":"Ann. of Math."},{"issue":"1","key":"10.1016\/j.ejc.2020.103200_b31","doi-asserted-by":"crossref","DOI":"10.37236\/405","article-title":"Coloring the edges of a random graph without a monochromatic giant component","volume":"17","author":"Sp\u00f6hel","year":"2010","journal-title":"Electron. J. Combin."},{"issue":"3","key":"10.1016\/j.ejc.2020.103200_b32","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/rsa.10088","article-title":"Tur\u00e1n\u2019s theorem in sparse random graphs","volume":"23","author":"Szab\u00f3","year":"2003","journal-title":"Random Struct. Algorithms"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669820301219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669820301219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T01:21:25Z","timestamp":1735694485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669820301219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":32,"alternative-id":["S0195669820301219"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2020.103200","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An analogue of the Erd\u0151s\u2013Gallai theorem for random graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2020.103200","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"103200"}}