Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs

DOI10.1016/j.dam.2021.05.028zbMath1466.05129OpenAlexW3167939392MaRDI QIDQ2032988

Yaojun Chen, Yu-Chen Liu

Publication date: 14 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.028

zbMATH Keywords

complete bipartite graphGallai coloring\( \ell \)-uniform Ramsey numberGallai Ramsey numberuniform coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

The Erdős–Gyárfás function with respect to Gallai‐colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• Edge-colored complete graphs with precisely colored subgraphs
• Gallai colorings of non-complete graphs
• A note on perfect graphs
• All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
• Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
• The Erdős-Hajnal conjecture for rainbow triangles
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Ramsey functions involving \(K_{m,n}\) with \(n\) large
• Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
• Ramsey-type results for Gallai colorings
• Recent developments in graph Ramsey theory
• Edge colorings of complete graphs without tricolored triangles
• Gallai‐Ramsey number for K4
• Transitiv orientierbare Graphen
• Graph pairs and their entropies: Modularity problems

This page was built for publication: Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs