# Rainbow Turán Problems for Paths and Forests of Stars

@article{Johnston2017RainbowTP,
title={Rainbow Tur{\'a}n Problems for Paths and Forests of Stars},
author={Daniel Johnston and Cory Palmer and Amites Sarkar},
journal={Electron. J. Comb.},
year={2017},
volume={24},
pages={P1.34}
}
• Published 31 August 2016
• Mathematics, Computer Science
• Electron. J. Comb.
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 {\emph 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 {\emph rainbow Tur\'an number} of $F$, and its systematic study was initiated by Keevash, Mubayi, Sudakov and Verstra\"ete in 2007. We determine $ex^*(n,F)$ exactly when $F$ is a forest of stars, and give… Expand
Lower bounds for rainbow Turan numbers of paths and other trees
• Computer Science, Mathematics
• Australas. J Comb.
• 2020
It is shown that the maximum number of edges in a properly edge-colored graph on n vertices which does not contain a rainbow copy of F is the rainbow Turan number of F, denoted by $ex*(n, F). Expand On the Rainbow Tur\'an number of paths • Mathematics • 2018 Let$F$be a fixed graph. The rainbow Tur\'an 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$(where aExpand Rainbow cycles vs. rainbow paths • Mathematics • 2020 An edge-colored graph$F$is {\it rainbow} if each edge of$F$has a unique color. The {\it rainbow Turan number}$\mathrm{ex}^*(n,F)$of a graph$F$is the maximum possible number of edges in aExpand On the Rainbow Turán number of paths • Mathematics, Computer Science • Electron. J. Comb. • 2019 It is shown 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 Johnston, Palmer and Sarkar. Expand Generalized rainbow Tur\'an problems • Mathematics • 2019 Alon and Shikhelman initiated the systematic study of the following generalized Turan problem: for fixed graphs$H$and$F$and an integer$n$, what is the maximum number of copies of$H$in anExpand The generalised rainbow Tur\'an problem for cycles Given an edge-coloured graph, we say that a subgraph is rainbow if all of its edges have different colours. Let$\operatorname{ex}(n,H,$rainbow-$F)$denote the maximal number of copies of$H$that aExpand Tur\'an numbers for hypergraph star forests • Mathematics • 2020 Fix a graph$F$. We say that a graph is {\it$F$-free} if it does not contain$F$as a subgraph. The {\it Tur\'an number} of$F$, denoted$\mathrm{ex}(n,F)$, is the maximum number of edges possibleExpand Generalizations of the Ruzsa-Szemer\'edi and rainbow Tur\'an problems for cliques • Mathematics • 2020 Considering a natural generalization of the Ruzsa-Szemeredi problem, we prove that for any fixed positive integers$r,s$with$r<s$, there are graphs on$n\$ vertices containingExpand
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
• Mathematics
• 2020
Considering a natural generalization of the Ruzsa–Szemerédi problem, we prove that for any fixed positive integers r, s with r < s, there are graphs on n vertices containing Expand
Generalized rainbow Turán problems
Alon and Shikhelman [J. Comb. Theory, B. 121 (2016)] initiated the systematic study of the following generalized Turán problem: for fixed graphs H and F and an integer n, what is the maximum numberExpand