Results 111 to 120 of about 1,180 (130)
The strength of Ramsey's theorem for pairs and arbitrarily many colors
Theodore A. Slaman, Keita Yokoyama
openalex +2 more sources
The Strength of Ramsey's Theorem For Pairs over trees: I. Weak König's Lemma
Chi Tat Chong, Wei Li, Lu Liu, Yue Yang
openalex +2 more sources
Ramsey type theorems in the plane
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2019
Ramsey theory studies, generally speaking, the following problem: Suppose that a given structure is colored using finitely many colors (equivalently, partition into finitely many pieces). Which combinatorial configurations can be found that are monochromatic, i.e.
Isaac Goldbring+2 more
openaire +2 more sources
Ramsey theory studies, generally speaking, the following problem: Suppose that a given structure is colored using finitely many colors (equivalently, partition into finitely many pieces). Which combinatorial configurations can be found that are monochromatic, i.e.
Isaac Goldbring+2 more
openaire +2 more sources
2013
Frank Plumpton Ramsey was an extraordinary man. He was born in 1903 in Cambridge as the elder son of A.S. Ramsey who was a mathematician and President of Magdalene College. His younger brother Michael went on to become Archbishop of Canterbury.
openaire +2 more sources
Frank Plumpton Ramsey was an extraordinary man. He was born in 1903 in Cambridge as the elder son of A.S. Ramsey who was a mathematician and President of Magdalene College. His younger brother Michael went on to become Archbishop of Canterbury.
openaire +2 more sources
2001
In 1930 Frank Plumpton Ramsey had written a paper On a problem in formal logic which initiated a part of discrete mathematics nowadays known as Ramsey Theory. At about the same time B.L. van der Waerden (1927) proved his famous Ramsey-type result on arithmetical progressions. A few years later Ramsey’s theorem was rediscovered by P.
openaire +2 more sources
In 1930 Frank Plumpton Ramsey had written a paper On a problem in formal logic which initiated a part of discrete mathematics nowadays known as Ramsey Theory. At about the same time B.L. van der Waerden (1927) proved his famous Ramsey-type result on arithmetical progressions. A few years later Ramsey’s theorem was rediscovered by P.
openaire +2 more sources
2012
In this chapter, the following theorem—which can be considered as the nucleus of Ramsey Theory—will be discussed in great detail.
openaire +2 more sources
In this chapter, the following theorem—which can be considered as the nucleus of Ramsey Theory—will be discussed in great detail.
openaire +2 more sources