No label defined (Q3770573)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4029619
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4029619

      Statements

      0 references
      0 references
      1987
      0 references
      numerical results
      0 references
      Ramsey theory
      0 references
      colorings
      0 references
      Ramsey numbers
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references