{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:28Z","timestamp":1740107128767,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["426894"],"award-info":[{"award-number":["426894"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00373-024-02861-x","type":"journal-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T20:01:25Z","timestamp":1732046485000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Non-Isomorphic Edge-Color Classes in Random Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Patrick","family":"Bennett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Cushman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6410-5413","authenticated-orcid":false,"given":"Andrzej","family":"Dudek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Sprangel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"2861_CR1","first-page":"63","volume":"22","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R.: Threshold functions for H-factors [MR1249126 (94k:05149)]. Comb. Geom. Probab. 22, 63\u201370 (1997)","journal-title":"Comb. Geom. Probab."},{"key":"2861_CR2","unstructured":"Andrews, G. E.: The Theory of Partitions, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1998. Reprint of the original (1976)"},{"issue":"3","key":"2861_CR3","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.jctb.2011.10.002","volume":"102","author":"I Ben-Eliezer","year":"2012","unstructured":"Ben-Eliezer, I., Krivelevich, M., Sudakov, B.: The size-Ramsey number of a directed path. J. Combin. Theory Ser. B 102(3), 743\u2013755 (2012)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"2861_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S096354831400056X","volume":"24","author":"A Dudek","year":"2015","unstructured":"Dudek, A., Pra\u0142at, P.: An alternative proof of the linearity of the size-Ramsey number of paths. Comb. Probab. Comput. 24(3), 551\u2013555 (2015)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"2861_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02579174","volume":"1","author":"P Erd\u0151s","year":"1981","unstructured":"Erd\u0151s, P.: On the combinatorial problems which i would most like to see solved. Combinatorica 1(1), 25\u201342 (1981)","journal-title":"Combinatorica"},{"issue":"3","key":"2861_CR6","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1112\/jlms.12179","volume":"99","author":"A Ferber","year":"2019","unstructured":"Ferber, A., Samotij, W.: Packing trees of unbounded degrees in random graphs. J. Lond. Math. Soc. 99(3), 653\u2013677 (2019)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"2861_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20396","volume":"41","author":"A Frieze","year":"2012","unstructured":"Frieze, A., Krivelevich, M.: Packing Hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithm. 41(1), 1\u201322 (2012)","journal-title":"Random Struct. Algorithm."},{"issue":"4","key":"2861_CR8","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1002\/rsa.21013","volume":"59","author":"A Heckel","year":"2021","unstructured":"Heckel, A.: Random triangles in random graphs. Random Struct. Algorithm. 59(4), 616\u2013621 (2021)","journal-title":"Random Struct. Algorithm."},{"key":"2861_CR9","series-title":"Wiley-interscience series in discrete mathematics and optimization.","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random Graphs. Wiley-interscience series in discrete mathematics and optimization., Wiley-Interscience, New York (2000)"},{"issue":"1","key":"2861_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A Johansson","year":"2008","unstructured":"Johansson, A., Kahn, J., Vu, V.: Factors in random graphs. Random Struct. Algorithm. 33(1), 1\u201328 (2008)","journal-title":"Random Struct. Algorithm."},{"key":"2861_CR11","doi-asserted-by":"publisher","first-page":"109019","DOI":"10.1016\/j.aim.2023.109019","volume":"422","author":"J Kahn","year":"2023","unstructured":"Kahn, J.: Asymptotics for Shamir\u2019s problem. Adv. Math. 422, 109019 (2023)","journal-title":"Adv. Math."},{"issue":"3","key":"2861_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1002\/rsa.20510","volume":"46","author":"F Knox","year":"2015","unstructured":"Knox, F., Kuhn, D., Osthus, D.: Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithm. 46(3), 397\u2013445 (2015)","journal-title":"Random Struct. Algorithm."},{"key":"2861_CR13","unstructured":"Knuth, D. E.: The art of computer programming. In: Fundamental algorithms, Third edition [of MR0286317]. Vol. 1, Addison-Wesley, Reading (1997)"},{"issue":"3","key":"2861_CR14","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/110849171","volume":"26","author":"M Krivelevich","year":"2012","unstructured":"Krivelevich, M., Samotij, W.: Optimal packings of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 26(3), 964\u2013982 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"2861_CR15","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1002\/rsa.21111","volume":"61","author":"O Riordan","year":"2022","unstructured":"Riordan, O.: Random cliques in random graphs and sharp thresholds for F-factors. Random Struct. Algorithm. 61(4), 619\u2013637 (2022)","journal-title":"Random Struct. Algorithm."},{"issue":"1\u20133","key":"2861_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0012-365X(92)90141-2","volume":"105","author":"A Ruci\u0144ski","year":"1992","unstructured":"Ruci\u0144ski, A.: Matching and covering the vertices of a random graph by copies of a given graph. Discrete Math. 105(1\u20133), 185\u2013197 (1992)","journal-title":"Discrete Math."},{"issue":"2\u20133","key":"2861_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(83)90044-4","volume":"45","author":"J Schmidt","year":"1983","unstructured":"Schmidt, J., Shamir, E.: A threshold for perfect matchings in random d-pure hypergraphs. Discrete Math. 45(2\u20133), 287\u2013295 (1983)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02861-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02861-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02861-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:42Z","timestamp":1733515662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02861-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,19]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2861"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02861-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,19]]},"assertion":[{"value":"4 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":3,"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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"126"}}