On minimal Ramsey graphs and Ramsey equivalence in multiple colours

DOI10.1017/S0963548320000036zbMath1466.05209arXiv1809.09232OpenAlexW3099116203MaRDI QIDQ4993105

Damian Reding, Anita Liebenau, Dennis Clemens

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

chromatic number\(q\)-Ramsey graph

Mathematics Subject Classification ID

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

Related Items (3)

Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Chromatic number is Ramsey distinguishing ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum degree of minimal Ramsey graphs for multiple colours
• What is Ramsey-equivalent to a clique?
• A new upper bound for diagonal Ramsey numbers
• On the use of senders in generalized Ramsey theory for graphs
• Ramsey-minimal graphs for star-forests
• The Ramsey property for graphs with forbidden complete subgraphs
• Asymptotic lower bounds for Ramsey functions
• Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• On the minimum degree of minimal Ramsey graphs
• Ramsey unsaturated and saturated graphs
• The minimum degree of Ramsey-minimal graphs
• On Ramsey Minimal Graphs
• An upper bound for some ramsey numbers
• Threshold Functions for Ramsey Properties
• Conditions on Ramsey Nonequivalence
• Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• On Ramsey minimal graphs

This page was built for publication: On minimal Ramsey graphs and Ramsey equivalence in multiple colours