Gallai-Ramsey numbers for monochromatic triangles or 4-cycles

DOI10.1007/s00373-018-1977-6zbMath1402.05082OpenAlexW2901349718WikidataQ128914933 ScholiaQ128914933MaRDI QIDQ1756099

Colton Magnant, Haibo Wu

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1977-6

zbMATH Keywords

colored complete graphsedge-colorings of complete graphs

Mathematics Subject Classification ID

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

Related Items (2)

Size Gallai-Ramsey number ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars

Cites Work

• Unnamed Item
• Gallai-Ramsey numbers for cycles
• Rainbow generalizations of Ramsey theory: A survey
• Edge-colored complete graphs with precisely colored subgraphs
• Edge-colorings avoiding rainbow and monochromatic subgraphs
• All Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles
• Ramsey-type results for Gallai colorings
• Lambda composition
• Edge colorings of complete graphs without tricolored triangles
• Gallai‐Ramsey number for K4
• Transitiv orientierbare Graphen
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
• Combinatorial Relations and Chromatic Graphs
• Generalized and geometric Ramsey numbers for cycles.

This page was built for publication: Gallai-Ramsey numbers for monochromatic triangles or 4-cycles