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}
}
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
TLDR
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
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
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
TLDR
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
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
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
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
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 Turá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
...
1
2
...

References

SHOWING 1-10 OF 19 REFERENCES
Rainbow Turán Problems
TLDR
The rainbow Turán problem for even cycles is studied, and the bound $\ex^*(n,C_6) = O(n^{4/3})$, which is of the correct order of magnitude, is proved. Expand
Long rainbow path in properly edge-colored complete graphs
Let $G$ be an edge-colored graph. A rainbow (heterochromatic, or multicolored) path of $G$ is such a path in which no two edges have the same color. Let the color degree of a vertex $v$ be the numberExpand
On the Turán Number of Forests
TLDR
The Turan number is determined and the unique extremal graph for forests consisting of paths when $n$ is sufficiently large is found. Expand
Rainbow Turán problem for even cycles
TLDR
The rainbow Turan number of even cycles is studied, and it is proved that for every fixed @e>0, there is a constant C(@e) such that every properly edge-colored graph on n vertices with at least C( @e)n^1^+^@e edges contains a rainbow cycle of even length. Expand
ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS
In 1940 TURIN raised the following question: if the number of nodes, n, of a graph’ is prescribed and if I is an integer cs n, what is the number of edges which the graph has to contain in order toExpand
Turán Numbers of Multiple Paths and Equibipartite Forests
TLDR
The Turán number of a graph H, ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph, and is determined for arbitrary l, and n appropriately large relative to k and l. Expand
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph Kn has a rainbowExpand
On Rainbow Cycles and Paths
TLDR
This thesis proves that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1)!)n vertices, improving on the previously best bound of (2n+1)/3 from Gyarfas and Mhalla. Expand
Rainbow and orthogonal paths in factorizations of Kn
For n even, a factorization of a complete graph Kn is a partition of the edges into n−1 perfect matchings, called the factors of the factorization. With respect to a factorization, a path is calledExpand
Path Ramsey numbers in multicolorings
Abstract In this paper we consider the general Ramsey number problem for paths when the complete graph is colored with k colors. Specifically, given paths P i 1 , P i 2 ,…, P i k with i 1 , i 2 ,…, iExpand
...
1
2
...