On the rainbow Turán number of paths
From MaRDI portal
Publication:668069
zbMath1406.05045arXiv1805.04180MaRDI QIDQ668069
Beka Ergemlidze, Abhishek Methuku, Ervin Gyoeri
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.04180
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
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, Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees
Cites Work
- Rainbow Turán problems for paths and forests of stars
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- Theorems in the additive theory of numbers
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Rainbow Turán problem for even cycles
- On maximal paths and circuits of graphs
- Rainbow Turán Problems
