List of things named after Paul Erdos
Encyclopedia
The following were named after Paul Erdős
:
Paul Erdos
Paul Erdős was a Hungarian mathematician. Erdős published more papers than any other mathematician in history, working with hundreds of collaborators. He worked on problems in combinatorics, graph theory, number theory, classical analysis, approximation theory, set theory, and probability theory...
:
- Paul Erdős AwardPaul Erdős AwardThe Paul Erdős Award, named after Paul Erdős, is given by theWorld Federation of National Mathematics Competitions for those who "have played a significant role in the development of mathematical challenges at the national or international level and which have been a stimulus for the enrichment of...
of the World Federation of National Mathematics Competitions - Erdős PrizeErdős Prize- References :*...
- Anna and Paul Erdős postdoctoral Fellowship of the Mathematics Department of the Technion
- Erdős numberErdos numberThe Erdős number describes the "collaborative distance" between a person and mathematician Paul Erdős, as measured by authorship of mathematical papers.The same principle has been proposed for other eminent persons in other fields.- Overview :...
- Erdős cardinalErdos cardinalIn mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by .The Erdős cardinal κ is defined to be the least cardinal such that for every function...
- Erdős conjectureErdos conjectureThe prolific mathematician Paul Erdős and his various collaborators made many famous mathematical conjectures, over a wide field of subjects.Some of these are the following:* The Cameron–Erdős conjecture on sum-free sets of integers, proved by Ben Green....
— a list of numerous conjectures named after Erdős- Erdős–Turán conjecture on additive basesErdős–Turán conjecture on additive basesThe Erdős–Turán conjecture is an old unsolved problem in additive number theory posed by Paul Erdős and Pál Turán in 1941.-History:...
- Erdős conjecture on arithmetic progressions
- Erdős distinct distances problemErdős distinct distances problemIn discrete geometry, the Erdős distinct distances problem states that between distinct points on a plane there are at least distinct distances. It was posed by Paul Erdős in 1946. In a 2010 preprint, Larry Guth and Nets Hawk Katz announced a solution....
- Cameron–Erdős conjecture
- Erdős–Burr conjectureErdos–Burr conjectureIn mathematics, the Erdős–Burr conjecture is an unsolved problem concerning the Ramsey number of sparse graphs. The conjecture is named after Paul Erdős and Stefan Burr, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs...
- Erdős–Faber–Lovász conjectureErdos–Faber–Lovász conjectureIn graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in 1972...
- Erdős–Graham conjecture — see Erdős–Graham problem
- Erdős–Gyárfás conjectureErdos–Gyárfás conjectureIn graph theory, the unproven Erdős–Gyárfás conjecture, made in 1995 by the prolific mathematician Paul Erdős and his collaborator András Gyárfás, states that any graph with minimum degree 3 contains a simple cycle whose length is a power of two...
- Erdős–Straus conjectureErdos–Straus conjectureIn number theory, the Erdős–Straus conjecture states that for all integers n ≥ 2, the rational number 4/n can be expressed as the sum of three unit fractions. Paul Erdős and Ernst G...
- Erdős–Turán conjectureErdos–Turan conjectureErdős' conjecture on arithmetic progressions, often incorrectly referred to as the Erdős–Turán conjecture , is a conjecture in additive combinatorics due to Paul Erdős...
- Erdős–Turán conjecture on additive bases
- Copeland–Erdős constant
- Erdős–Bacon number
- Erdős–Borwein constant
- Erdős–Diophantine graph
- Erdős–Mordell inequalityErdos–Mordell inequalityIn Euclidean geometry, the Erdős–Mordell inequality states that for any triangle ABC and point O inside ABC, the sum of the distances from O to the sides is less than or equal to half of the sum of the distances from O to the vertices. It is named after Paul Erdős and Louis Mordell. posed the...
- Erdős–Rényi modelErdos–Rényi modelIn graph theory, the Erdős–Rényi model, named for Paul Erdős and Alfréd Rényi, is either of two models for generating random graphs, including one that sets an edge between each pair of nodes with equal probability, independently of the other edges...
- Erdős spaceErdős spaceIn mathematics, Erdős space is a topological space named after Paul Erdős.Erdős space is defined as the set E of points in the Hilbert space l2 of square summable sequences having all coordinates rational. Erdős space is a totally disconnected, one-dimensional topological space. The space E is...
- Erdős theorems
- de Bruijn–Erdős theorem (graph theory)
- de Bruijn–Erdős theorem (incidence geometry)De Bruijn–Erdős theorem (incidence geometry)In incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős, states a lower bound on the number of lines determined by n points in a projective plane...
- Erdős–Anning theoremErdos–Anning theoremThe Erdős–Anning theorem states that an infinite number of points in the plane can have mutual integer distances only if all the points lie on a straight line. It is named after Paul Erdős and Norman H...
- Erdős–Beck theorem
- Erdős–Dushnik–Miller theorem
- Erdős–Gallai theoremErdős–Gallai theoremThe Erdős–Gallai theorem is a result in graph theory, a branch of combinatorics, that gives a necessary and sufficient condition for a finite sequence to be the degree sequence of a simple graph...
- Erdős–Kac theoremErdos–Kac theoremIn number theory, the Erdős–Kac theorem, named after Paul Erdős and Mark Kac, and also known as the fundamental theorem of probabilistic number theory, states that if ω is the number of distinct prime factors of n, then, loosely speaking, the probability distribution ofis the standard normal...
- Erdős–Ko–Rado theoremErdos–Ko–Rado theoremIn combinatorics, the Erdős–Ko–Rado theorem of Paul Erdős, Chao Ko, and Richard Rado is a theorem on hypergraphs, specifically, on uniform hypergraphs of rank r.The theorem is as follows...
- Erdős–Nagy theorem
- Erdős–Rado theoremErdős–Rado theoremIn partition calculus, part of combinatorial set theory, which is a branch of mathematics, the Erdős–Rado theorem is a basic result, extending Ramsey's theorem to uncountable sets.-Statement of the theorem:If r≥2 is finite, κ is an infinite cardinal, then...
- Erdős–Stone theoremErdos–Stone theoremIn extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H...
- Erdős–Szekeres theoremErdos–Szekeres theoremIn mathematics, the Erdős–Szekeres theorem is a finitary result that makes precise one of the corollaries of Ramsey's theorem. While Ramsey's theorem makes it easy to prove that every sequence of distinct real numbers contains either a monotonically increasing infinite subsequence, or a...
- Erdős–Turán inequalityErdős–Turán inequalityIn mathematics, the Erdős–Turán inequality bounds the distance between a probability measure on the circle and the Lebesgue measure, in terms of Fourier coefficients. It was proved by Paul Erdős and Paul Turán in 1948....
- Erdős–Woods numberErdos–Woods numberIn number theory, an Erdős–Woods number is a positive integer that has the following property:Consider a sequence of consecutive positive integers [a, a+1, \dots, a+k]. The number k is an Erdős–Woods number if there exists such a sequence, beginning with some number a, in which each of the elements...