Ramsey and Gallai-Ramsey number for wheels
From MaRDI portal
Publication:2115156
Abstract: Given a graph and a positive integer , define the emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains either a rainbow (all different colored) triangle or a monochromatic copy of . Much like graph Ramsey numbers, Gallai-Ramsey numbers have gained a reputation as being very difficult to compute in general. As yet, still only precious few sharp results are known. In this paper, we obtain bounds on the Gallai-Ramsey number for wheels and the exact value for the wheel on vertices.
Recommendations
Cites work
- All Ramsey numbers for cycles in graphs
- Edge colorings of complete graphs without tricolored triangles
- Extending cycles in graphs
- Generalized and geometric Ramsey numbers for cycles.
- Lambda composition
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- The Ramsey numbers for cycles versus wheels of odd order
- Transitiv orientierbare Graphen
Cited in
(12)- Complete bipartite graphs without small rainbow subgraphs
- Gallai-Ramsey number of an 8-cycle
- Gallai-Ramsey numbers involving a rainbow 4-path
- Ramsey and Gallai-Ramsey numbers for comb and sun graphs
- Gallai-Ramsey numbers for graphs with five vertices and chromatic number four
- On the sum number of wheels
- Gallai-Ramsey numbers for books
- Size Gallai-Ramsey number
- Weakened Gallai-Ramsey numbers
- A note on Gallai-Ramsey number of even wheels
- Gallai-Ramsey numbers for paths
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
This page was built for publication: Ramsey and Gallai-Ramsey number for wheels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115156)