On the rainbow Turán number of paths (Q668069): Difference between revisions

Summary: Let \(F\) be a fixed graph. The rainbow Turán 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 \textit{P. Keevash} et al. [Comb. Probab. Comput. 16, No. 1, 109--126 (2007; Zbl 1119.05058)]. In this paper, we show that the rainbow Turán number of a path with \(k+1\) edges is less than \(\left(9k/7+2\right) n\), improving an earlier estimate of \textit{D. Johnston} et al. [Electron. J. Comb. 24, No. 1, Research Paper P1.34, 15 p. (2017; Zbl 1355.05111)].