scientific article; zbMATH DE number 4029619
[For the entire collection see Zbl 0611.00003.] The paper gives a nice survey on numerical results in Ramsey theory. Especially, colorings of the edges of complete graphs \(K_ n\) on n vertices as well as colorings of integers are considered, and bounds for the corresponding Ramsey numbers are given. For positive integers \(\delta\) and finite graphs \(G_ 1,G_ 2,...,G_{\delta}\) let \(r=r(G_ 1,...,G_{\delta})\) be the least positive integer such that for every coloring of the edges of the complete graph \(K_ r\) with colors 1,2,...,\(\delta\) there exists a positive integer \(i\leq \delta\) and a copy of \(G_ i\) with all edges having color i. For \(\delta =2\) the best known lower bound for the diagonal numbers \(r(K_ k,K_ k)\) is of the order \(c\cdot k\cdot 2^{k/2}\) for some positive constant c. The authors give a proof of a new upper bound, namely \(r(K_ k,K_ k)<6\cdot \left( \begin{matrix} 2k-2\\ k- 1\end{matrix} \right)/\log \log k\), which means a major progress in this area. For related results the reader is referred to the paper of A. Thomason: An upper bound for some Ramsey numbers. Several other results for arbitrary positive integers \(\delta\) and not necessary complete graphs \(G_ i\) are surveyed. Moreover, concerning colorings of integers the growth of the functions corresponding to the celebrated van der Waerden theorem on arithmetic progressions and the theorem of Rado, Folkman and Sanders on finite sums are discussed in detail.
- On the Ramsey problem for multicolor bipartite graphs
- Weakened Ramsey numbers
- Iterated combinatorial density theorems
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- On set systems without weak 3-\(\Delta\)-subsystems
- Lower bounds for hypergraph Ramsey numbers
- Zero-sum problems -- a survey
- Blowup Ramsey numbers
- On a diagonal conjecture for classical Ramsey numbers
- Off-diagonal hypergraph Ramsey numbers
- Ramsey for complete graphs with a dropped edge or a triangle
- The pigeonhole principle and multicolor Ramsey numbers
- scientific article; zbMATH DE number 6378629 (Why is no real title available?)
- scientific article; zbMATH DE number 3946178 (Why is no real title available?)
- scientific article; zbMATH DE number 3948322 (Why is no real title available?)
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Some recent results on Ramsey-type numbers
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 736297 (Why is no real title available?)
- Bounding some Ramsey functions
- Unexpected upper bounds on the complexity of some communication games
- scientific article; zbMATH DE number 795111 (Why is no real title available?)
- The Induced Size-Ramsey Number of Cycles
- Short proofs for long induced paths
- Compression using efficient multicasting
- Diagonal Ramsey via effective quasirandomness
- Sparse partition universal graphs for graphs of bounded degree
- Interview with David Conlon
- Upper bounds for multicolour Ramsey numbers
- An exponential improvement for diagonal Ramsey
- A new upper bound for diagonal Ramsey numbers
- An exponential improvement for Ramsey lower bounds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770573)