On the Rainbow Turan number of paths

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) On the Rainbow Turan number of paths. ELECTRONIC JOURNAL OF COMBINATORICS, 26 (1). ISSN 1097-1440

Preview

Text 180504180v1.pdf Available under License Creative Commons Attribution. Download (171kB) | Preview

Abstract

Let F be a fixed graph. The rainbow Turan number of 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 Verstraete. In this paper, we show that the rainbow Turan number of a path with k + 1 edges is less than (9k/7 + 2) n, improving an earlier estimate of Johnston, Palmer and Sarkar.

Actions (login required)

Edit Item