The tail is cut for Ramsey numbers of cubes
type: Item
instance of: scholarly article
title: The tail is cut for Ramsey numbers of cubes
zbMATH Open document ID: 1111.05070
published in: Discrete Mathematics
publication date: 2007-02-13T00:00:00Z
review text: The Ramsey number of a graph is the least number \(p\) such that for all bicolorings of the edges of the complete graph of order \(p\), one of the monochromatic subgraphs contains a copy of the graph. The paper gives an upper bound for the Ramsey number of a bipartite graph, where the maximum degree of vertices in one part is restricted, and that of the cube. These bounds are a tightening of an earlier result by the author by removing the small term from the powers in the upper bounds.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 5124997
author: Lingsheng Shi
reviewed by: Wai-Kai Chen
MaRDI profile type: Publication
full work available at URL: j.disc.2006.07.005
OpenAlex ID: W2018966352
cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
cites work: Q3717088
cites work: Q4075489
cites work: On graphs with linear Ramsey numbers
cites work: On bipartite graphs with linear Ramsey numbers
cites work: On graphs with small Ramsey numbers
cites work: Cube Ramsey numbers are polynomial
cites work: Linear Ramsey numbers of sparse graphs
DOI: 10.1016/J.DISC.2006.07.005
description: scientific article; zbMATH DE number 5124997