Chromatic number is Ramsey distinguishing

DOI10.1002/jgt.22731zbMath1522.05490arXiv1909.02590MaRDI QIDQ6056800

Unnamed Author

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberRamsey equivalenceRamsey distinguishing

Mathematics Subject Classification ID

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

Related Items (1)

Ramsey Equivalence for Asymmetric Pairs of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What is Ramsey-equivalent to a clique?
• The Ramsey property for graphs with forbidden complete subgraphs
• Chromatic Ramsey numbers
• Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
• On the minimum degree of minimal Ramsey graphs
• Random graphs with monochromatic triangles in every edge coloring
• Threshold Functions for Ramsey Properties
• On minimal Ramsey graphs and Ramsey equivalence in multiple colours
• Conditions on Ramsey Nonequivalence
• A Short Proof of the Random Ramsey Theorem
• On chromatic number of graphs and set-systems
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: Chromatic number is Ramsey distinguishing