Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees
From MaRDI portal
Publication:5139689
zbMath1453.05050arXiv1901.03308MaRDI QIDQ5139689
No author found.
Publication date: 10 December 2020
Full work available at URL: https://arxiv.org/abs/1901.03308
Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Generalized rainbow Turán problems ⋮ 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 ⋮ Rainbow saturation
Cites Work
- Unnamed Item
- Rainbow Turán problems for paths and forests of stars
- On the rainbow Turán number of paths
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- Pentagons vs. triangles
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Edge-disjoint rainbow trees in properly coloured complete graphs
- Rainbow Turán problem for even cycles
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- Rainbow Turán Problems
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- A Generalized Turán Problem and its Applications
- Many \(T\) copies in \(H\)-free graphs
