AbstractIn this paper, a survey is given of some of the recent research which is related to a particular combinatorial principle namely the Ramsey theorem.One uses very often elementary and less elementary combinatorial facts and it is not important whether one deserves the name ‘principle’ for them. As examples consider the principle of inclusion and exclusion, the pigeonhole principle, counting in two ways, several basic properties of trees etc. It is the author's aim here to show a large variety of applications of the Ramsey theorem. It should be stressed that none of the classical and ‘standard’ applications is mentioned. These can be found in several books and survey articles examples of which are the works of Graham et al. (1980) and ...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard ...
AbstractUsing methods developed by Graver and Yackel, and various computer algorithms, we show that ...
The goal of this present manuscript is to introduce the reader to the nonstandard method and to prov...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
There are many famous problems on finding a regular substructure in a sufficiently large combinatori...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
The goal of this monograph is to give an accessible introduction to nonstandard methods and their ap...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
he main objective of this research is to study the relative strength of combinatorial principles, in...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard ...
AbstractUsing methods developed by Graver and Yackel, and various computer algorithms, we show that ...
The goal of this present manuscript is to introduce the reader to the nonstandard method and to prov...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
There are many famous problems on finding a regular substructure in a sufficiently large combinatori...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
The goal of this monograph is to give an accessible introduction to nonstandard methods and their ap...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
he main objective of this research is to study the relative strength of combinatorial principles, in...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard ...
AbstractUsing methods developed by Graver and Yackel, and various computer algorithms, we show that ...