Rainbow Turán problems for paths and forests of stars

zbMath1355.05111arXiv1609.00069MaRDI QIDQ510352

Yong-Cai Geng, Sumit K. Garg

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.00069

zbMATH Keywords

starspathsrainbow Turán numbers

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Turán numbers for hypergraph star forests ⋮ Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ Generalized rainbow Turán problems ⋮ The Generalized Rainbow Turán Problem for Cycles ⋮ Generalized rainbow Turán numbers of odd cycles ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ Rainbow cycles vs. rainbow paths ⋮ Graphs without a Rainbow Path of Length 3 ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Unnamed Item ⋮ On the rainbow Turán number of paths ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees

Cites Work

• Unnamed Item
• On the Turán number of forests
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
• Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Path Ramsey numbers in multicolorings
• Rainbow Turán problem for even cycles
• Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• Rainbow Turán Problems
• Rainbow and orthogonal paths in factorizations ofKn
• Hamilton circuits with many colours in properly edge-coloured complete graphs.

This page was built for publication: Rainbow Turán problems for paths and forests of stars