{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:07Z","timestamp":1753893787987,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For graphs $G,H$, we write $G \\overset{\\mathrm{rb}}{\\longrightarrow} H $ if for every proper edge-coloring of $G$ there is a rainbow copy of $H$, i.e., a copy where no color appears more than once. Kohayakawa, Konstadinidis and the last author proved that the threshold for $G(n,p) \\overset{\\mathrm{rb}}{\\longrightarrow} H$ is at most $n^{-1\/m_2(H)}$. Previous results have matched the lower bound for this anti-Ramsey threshold for cycles and complete graphs with at least 5 vertices. Kohayakawa, Konstadinidis and the last author also presented an infinite family of graphs $H$ for which the anti-Ramsey threshold is asymptotically smaller than $n^{-1\/m_2(H)}$. In this paper, we devise a framework that provides a richer family of such graphs.<\/jats:p>","DOI":"10.37236\/11449","type":"journal-article","created":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T16:23:23Z","timestamp":1711038203000},"source":"Crossref","is-referenced-by-count":1,"title":["On the Anti-Ramsey Threshold for Non-Balanced Graphs"],"prefix":"10.37236","volume":"31","author":[{"given":"Pedro","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"given":"Ta\u00edsa","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Let\u00edcia","family":"Mattos","sequence":"additional","affiliation":[]},{"given":"Walner","family":"Mendon\u00e7a","sequence":"additional","affiliation":[]},{"given":"Luiz","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Guilherme O.","family":"Mota","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2024,3,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p70\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i1p70\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T16:23:23Z","timestamp":1711038203000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i1p70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,22]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1,12]]}},"URL":"https:\/\/doi.org\/10.37236\/11449","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2024,3,22]]},"article-number":"P1.70"}}