Size Gallai-Ramsey number
From MaRDI portal
Publication:6143692
DOI10.1007/s00373-023-02720-1zbMath1529.05156OpenAlexW4388945406MaRDI QIDQ6143692
Publication date: 5 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02720-1
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- Size Ramsey numbers involving stars
- The size Ramsey number
- Small Ramsey numbers
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Remarks on the size Ramsey number of graphs
- Ramsey and Gallai-Ramsey number for wheels
- Gallai-Ramsey number for the union of stars
- Gallai-Ramsey numbers for fans
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
- Ramsey-type results for Gallai colorings
- On-line Ramsey Numbers
- Lambda composition
- Asymptotic Size Ramsey Results for Bipartite Graphs
- Edge colorings of complete graphs without tricolored triangles
- On the Size-Ramsey Number of Tight Paths
- The size Ramsey number of short subdivisions of bounded degree graphs
- Size Ramsey numbers for small‐order graphs
- On size Ramsey number of paths, trees, and circuits. I
- Transitiv orientierbare Graphen
- The size-Ramsey number of trees
- Gallai–Ramsey number for K5 ${K}_{5}$
This page was built for publication: Size Gallai-Ramsey number
