Gallai-Ramsey numbers for books

DOI10.1016/J.DAM.2019.04.013zbMATH Open1419.05087arXiv1802.04930OpenAlexW2963645133WikidataQ127928231 ScholiaQ127928231MaRDI QIDQ2274089FDOQ2274089

Authors: Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye 

Publication date: 19 September 2019

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

Abstract: Given a graph $G$ and a positive integer $k$, the emph{Gallai-Ramsey number} is defined to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we obtain general upper and lower bounds on the Gallai-Ramsey numbers for books $B_m=K_2+overline{K}_m$ and prove sharp results for $mleq5$.

Full work available at URL: https://arxiv.org/abs/1802.04930

Recommendations

• Gallai-Ramsey numbers for fans
• Ramsey and Gallai-Ramsey number for wheels
• Gallai-Ramsey numbers involving a rainbow 4-path
• Gallai-Ramsey number for the union of stars
• Gallai-Ramsey numbers for cycles

zbMATH Keywords

Gallai-Ramseyrainbow trianglebook graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Transitiv orientierbare Graphen
• Rainbow generalizations of Ramsey theory: A survey
• Title not available (Why is that?)
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey-type results for Gallai colorings
• Edge colorings of complete graphs without tricolored triangles
• Title not available (Why is that?)
• Gallai-Ramsey numbers for cycles
• Edge-colored complete graphs with precisely colored subgraphs
• Lambda composition
• The Erdős-Hajnal conjecture for rainbow triangles
• Title not available (Why is that?)

Cited In (21)

• The Gallai-Ramsey number for a tree versus complete graphs
• Gallai-Ramsey numbers for graphs with chromatic number three
• A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
• Gallai-Ramsey numbers for cycles
• Ramsey and Gallai-Ramsey number for wheels
• Gallai-Ramsey numbers for a class of graphs with five vertices
• Title not available (Why is that?)
• The Gallai-Ramsey number for a tree versus complete graphs
• Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
• Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
• Ramsey Numbers Involving Large Books
• Gallai-Ramsey numbers for multiple triangles
• Ramsey numbers of large books
• Ramsey numbers of books and quasirandomness
• Gallai-Ramsey Multiplicity
• Weakened Gallai-Ramsey numbers
• Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
• Gallai-Ramsey numbers for graphs with five vertices and chromatic number four
• Book Ramsey Numbers and Quasi-Randomness
• Gallai-Ramsey number for the union of stars
• Gallai-Ramsey numbers of books

This page was built for publication: Gallai-Ramsey numbers for books

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274089)