{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:52:52Z","timestamp":1772484772526,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101044123"],"award-info":[{"award-number":["101044123"]}],"id":[{"id":"10.13039\/501100000781","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":[[2026,4]]},"DOI":"10.1016\/j.ejc.2026.104344","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T09:55:45Z","timestamp":1769075745000},"page":"104344","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the anti-Ramsey threshold"],"prefix":"10.1016","volume":"134","author":[{"given":"Eden","family":"Kuperwasser","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104344_b1","first-page":"P1","article-title":"On the anti-Ramsey threshold for non-balanced graphs","author":"Ara\u00fajo","year":"2024","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ejc.2026.104344_b2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.entcs.2019.08.009","article-title":"Anti-Ramsey threshold of cycles for sparse graphs","volume":"346","author":"Barros","year":"2019","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.ejc.2026.104344_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104159","article-title":"Thresholds for constrained Ramsey and anti-Ramsey problems","author":"Behague","year":"2025","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104344_b4","series-title":"The threshold for the constrained Ramsey property","author":"Collares","year":"2022"},{"key":"10.1016\/j.ejc.2026.104344_b5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jctb.2015.05.003","article-title":"Decomposing a graph into pseudoforests with one having bounded degree","volume":"115","author":"Fan","year":"2015","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2026.104344_b6","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.2026.104344_b7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1002\/jgt.22884","article-title":"Digraph analogues for the nine dragon tree conjecture","volume":"102","author":"Gao","year":"2023","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.ejc.2026.104344_b8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","article-title":"On the degrees of the vertices of a directed graph","volume":"279","author":"Hakimi","year":"1965","journal-title":"J. Franklin Inst."},{"issue":"6","key":"10.1016\/j.ejc.2026.104344_b9","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s00493-016-3390-1","article-title":"Decomposing a graph into forests: The nine dragon tree conjecture is true","volume":"37","author":"Jiang","year":"2017","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104344_b10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejc.2014.02.004","article-title":"On an anti-Ramsey threshold for random graphs","volume":"40","author":"Kohayakawa","year":"2014","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2026.104344_b11","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/jgt.22150","article-title":"On an anti-Ramsey threshold for sparse graphs with one triangle","volume":"87","author":"Kohayakawa","year":"2018","journal-title":"J. Graph Theory"},{"issue":"5","key":"10.1016\/j.ejc.2026.104344_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113343","article-title":"The anti-Ramsey threshold of complete graphs","volume":"346","author":"Kohayakawa","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104344_b13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2016.12.007","article-title":"An algorithmic framework for obtaining lower bounds for random Ramsey problems","volume":"124","author":"Nenadov","year":"2017","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.ejc.2026.104344_b14","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1090\/S0894-0347-1995-1276825-6","article-title":"Threshold functions for Ramsey properties","volume":"8","author":"R\u00f6dl","year":"1995","journal-title":"J. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/j.ejc.2026.104344_b15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/rsa.3240030207","article-title":"Rainbow subgraphs in properly edge-colored graphs","volume":"3","author":"R\u00f6dl","year":"1992","journal-title":"Random Structures Algorithms"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T19:53:13Z","timestamp":1772481193000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":15,"alternative-id":["S0195669826000120"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104344","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the anti-Ramsey threshold","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104344","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104344"}}