{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:24:15Z","timestamp":1759335855535,"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 a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n,F)$, is the rainbow Tur\u00e1n number\u00a0of $F$, and its systematic study was initiated by Keevash, Mubayi, Sudakov and Verstra\u00ebte [Combinatorics, Probability and Computing\u00a016 (2007)]. We determine $ex^*(n,F)$ exactly when $F$ is a forest of stars, and give bounds on $ex^*(n,F)$ when $F$ is a path with $l$ edges, disproving a conjecture in the aforementioned paper for $l=4$.<\/jats:p>","DOI":"10.37236\/6430","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T14:16:26Z","timestamp":1578665786000},"source":"Crossref","is-referenced-by-count":6,"title":["Rainbow Tur\u00e1n Problems for Paths and Forests of Stars"],"prefix":"10.37236","volume":"24","author":[{"given":"Daniel","family":"Johnston","sequence":"first","affiliation":[]},{"given":"Cory","family":"Palmer","sequence":"additional","affiliation":[]},{"given":"Amites","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,2,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p34\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p34\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T00:04:08Z","timestamp":1579219448000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/6430","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,17]]},"article-number":"P1.34"}}