Search results
Results From The WOW.Com Content Network
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of the mathematical field of combinatorics that focuses on the appearance of order in a substructure given a structure of a known size. Problems in Ramsey theory typically ask a question of the form: "how big must some structure be to guarantee ...
The Erdős–Szekeres conjecture states precisely a more general relationship between the number of points in a general-position point set and its largest subset forming a convex polygon, namely that the smallest number of points for which any general position arrangement contains a convex subset of points is +. It remains unproven, but less ...
Ergodic Ramsey theory is a branch of mathematics where problems motivated by additive combinatorics are proven using ergodic theory. ... Erdős and Turán conjectured ...
Of his contributions, the development of Ramsey theory and the application of the probabilistic method especially stand out. Extremal combinatorics owes to him a whole approach, derived in part from the tradition of analytic number theory. Erdős found a proof for Bertrand's postulate which proved to be far neater than Chebyshev's original
In 1930, in a paper entitled 'On a Problem of Formal Logic,' Frank P. Ramsey proved a very general theorem (now known as Ramsey's theorem) of which this theorem is a simple case. This theorem of Ramsey forms the foundation of the area known as Ramsey theory in combinatorics .
In mathematics, zero-sum Ramsey theory or zero-sum theory is a branch of combinatorics.It deals with problems of the following kind: given a combinatorial structure whose elements are assigned different weights (usually elements from an Abelian group), one seeks for conditions that guarantee the existence of certain substructure whose weights of its elements sum up to zero (in ).
In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets.Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom.
The Erdős–Heilbronn conjecture in combinatorial number theory on the number of sums of two sets of residues modulo a prime, proved by Dias da Silva and Hamidoune in 1994. [11] The Erdős–Graham conjecture in combinatorial number theory on monochromatic Egyptian fraction representations of unity, proved by Ernie Croot in 2000. [12]