The tail is cut for Ramsey numbers of cubes
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.
scientific article; zbMATH DE number 5124997