Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
From MaRDI portal
Publication:2874090
DOI10.1002/jgt.21723zbMath1280.05042OpenAlexW2102164786MaRDI QIDQ2874090
Masao Tsugaki, Colton Magnant, Kenta Ozeki, Martin Hall
Publication date: 28 January 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21723
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (19)
A conjecture on Gallai-Ramsey numbers of even cycles and paths ⋮ Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$ ⋮ Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs ⋮ Gallai-Ramsey number for the union of stars ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Complete bipartite graphs without small rainbow stars ⋮ Size Gallai-Ramsey number ⋮ Gallai-Ramsey numbers of \(C_7\) with multiple colors ⋮ Extremal problems and results related to Gallai-colorings ⋮ Monochromatic subgraphs in the absence of a properly colored 4-cycle ⋮ Gallai-Ramsey numbers of odd cycles and complete bipartite graphs ⋮ Gallai-Ramsey numbers for monochromatic triangles or 4-cycles ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs ⋮ Gallai-Ramsey number of even cycles with chords ⋮ Gallai-Ramsey number of odd cycles with chords ⋮ Gallai-Ramsey number of an 8-cycle ⋮ Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
Cites Work
- Unnamed Item
- Gallai-Ramsey numbers for cycles
- Rainbow generalizations of Ramsey theory: A survey
- Edge-colored complete graphs with precisely colored subgraphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Ramsey numbers for cycles in graphs
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Transitiv orientierbare Graphen
This page was built for publication: Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
