{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:23Z","timestamp":1753893863710,"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>Let $F$ be a fixed graph. The rainbow Tur\u00e1n number\u00a0of $F$ is defined as the maximum number of edges in a graph on $n$ vertices that has a proper edge-coloring with no rainbow copy of $F$ (i.e., a copy of $F$ all of whose edges have different colours). The systematic study of such problems was initiated by Keevash, Mubayi, Sudakov and Verstra\u00ebte.\r\n\u00a0In this paper, we show that the rainbow Tur\u00e1n number of a path with $k+1$ edges is less than $\\left(9k\/7+2\\right) n$, improving an earlier estimate of Johnston,\u00a0 Palmer and Sarkar.<\/jats:p>","DOI":"10.37236\/7889","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:15:49Z","timestamp":1578640549000},"source":"Crossref","is-referenced-by-count":3,"title":["On the Rainbow Tur\u00e1n number of paths"],"prefix":"10.37236","volume":"26","author":[{"given":"Beka","family":"Ergemlidze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ervin","family":"Gy\u0151ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Methuku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2019,2,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p17\/7776","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p17\/7776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:18:23Z","timestamp":1579234703000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i1p17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,8]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,11]]}},"URL":"https:\/\/doi.org\/10.37236\/7889","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,2,8]]},"article-number":"P1.17"}}