Determine the leading coefficient for rainbow Turán numbers of long paths

Determine the correct leading coefficient of the rainbow Turán number \(\mathrm{ex}^*(n,P_\ell)\) for every path \(P_\ell\) with \(\ell\geq 6\).

Background

The paper places rainbow Turán numbers for short brooms in the broader context of rainbow Turán numbers for trees and paths. Although the ordinary Turán number of every fixed path is known asymptotically, the authors note that the rainbow analogue remains unresolved for paths of length at least six. This is an explicitly stated unresolved problem in the introductory discussion motivating the study of brooms.

References

When \ell \in {3,4,5}, we have \mathrm{ex}*(n,P_{\ell}) = \frac{\ell}{2}n + O(1)$ (see ), but the correct leading coefficient for \mathrm{ex}*(n,P_{\ell}) is not known when \ell \geq 6$.

Rainbow Turán numbers for short brooms  (2502.16057 - Byrne et al., 22 Feb 2025) in Section 1, Introduction