What is Ramsey-equivalent to a clique?
type: Item
instance of: scholarly article
title: What is Ramsey-equivalent to a clique?
zbMATH Open document ID: 1301.05226
author: Jacob Fox
author: Andrey Grinshpun
author: Anita Liebenau
author: Yury Person
author: Tibor Szabó
published in: Journal of Combinatorial Theory. Series B
publication date: 2014-10-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1312.0299
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6359846
zbMATH Keywords: graph Ramsey theory
zbMATH Keywords: minimal Ramsey graphs
zbMATH Keywords: Ramsey-equivalence
MaRDI profile type: Publication
OpenAlex ID: W2028276181
arXiv ID: 1312.0299
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q4100121
cites work: A new upper bound for diagonal Ramsey numbers
cites work: Some remarks on the theory of graphs
cites work: On chromatic number of graphs and set-systems
cites work: On the minimum degree of minimal Ramsey graphs for multiple colours
cites work: The minimum degree of Ramsey-minimal graphs
cites work: The Ramsey property for graphs with forbidden complete subgraphs
cites work: On the minimum degree of minimal Ramsey graphs
DOI: 10.1016/J.JCTB.2014.06.003
description: scientific article; zbMATH DE number 6359846