All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
From MaRDI portal
Publication:1720329
DOI10.1016/j.dam.2018.06.031zbMath1404.05062arXiv1710.10455OpenAlexW2962796406WikidataQ129476891 ScholiaQ129476891MaRDI QIDQ1720329
Colton Magnant, Pouria Salehi Nowbandegani, Suman Xia, Haibo Wu
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10455
Related Items (9)
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four ⋮ Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ Gallai-Ramsey number for the union of stars ⋮ Star-critical Gallai-Ramsey numbers of graphs ⋮ Size Gallai-Ramsey number ⋮ Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings ⋮ Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars
Cites Work
- Unnamed Item
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- Ramsey-type theorems
- Edge-colored complete graphs with precisely colored subgraphs
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Ramsey numbers for all linear forests
- Bounds on Ramsey numbers of certain complete bipartite graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Ramsey theory applications
- Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
- Ramsey-type results for Gallai colorings
- Diagonal Ramsey numbers for small graphs
- The Ramsey number for stripes
- Lambda composition
- Edge colorings of complete graphs without tricolored triangles
- Gallai‐Ramsey number for K4
- Rainbow Ramsey theorems for colorings establishing negative partition relations
- Transitiv orientierbare Graphen
This page was built for publication: All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
