Graphs without a Rainbow Path of Length 3
From MaRDI portal
Publication:6188520
DOI10.1137/22m1535048arXiv2211.02308OpenAlexW4391476849MaRDI QIDQ6188520
Andrzej Grzesik, Sebastian Babiński
Publication date: 7 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.02308
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Rainbow Turán problems for paths and forests of stars
- A new proof of the graph removal lemma
- On the rainbow Turán number of paths
- Path Ramsey numbers in multicolorings
- Multicolour Turán problems
- Rainbow Turán problem for even cycles
- Non-monochromatic triangles in a 2-edge-coloured graph
- Generalized rainbow Turán problems
- On a colored Turán problem of Diwan and Mubayi
- Density of Gallai multigraphs
- Generalized rainbow Turán numbers of odd cycles
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- On maximal paths and circuits of graphs
- Rainbow Turán Problems
- Rainbow cycles vs. rainbow paths
- The Generalized Rainbow Turán Problem for Cycles
- A rainbow version of Mantel's Theorem
- Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees
- On the structure of linear graphs
This page was built for publication: Graphs without a Rainbow Path of Length 3
