Paul Erdős
Paul Erdős (Hungarian: Erdős Pál [ˈɛrdøːʃ paːl]; 26 March 1913 – 20 September 1996) was a Jewish-Hungarian mathematician. He was one of the most prolific mathematicians of the 20th century, but a...
Paul Erdős - Wikipedia
Erdos number
The Erdős number ([ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers.The same principle has been ap...
Erdos number - Wikipedia
List of people by Erdős number
Paul Erdős was one of the most prolific writers of mathematical papers. He often collaborated, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the "c...
Erdős–Burr conjecture
In mathematics, the Erdős–Burr conjecture is a 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 aft...
Erdős–Burr conjecture - Wikipedia
Erdős–Borwein constant
The Erdős–Borwein constant is the sum of the reciprocals of the Mersenne numbers. It is named after Paul Erdős and Peter Borwein.By definition it is:
It can be proven that the following forms all ...
Erdős–Borwein constant - Wikipedia
Erdős–Anning theorem
The 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 ...
Erdős–Anning theorem - Wikipedia
John Clive Ward
John Clive Ward (1 August 1924 – 6 May 2000) was a British-Australian physicist. His most famous creation was the Ward–Takahashi identity, originally known as "Ward Identity" (or "Ward Identities"). T...
Erdős number
The Erdős number ([ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers.The same principle has been ap...
Erdős number - Wikipedia
Proofs from THE BOOK
Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler. The book is dedicated to the mathematician Paul Erdős, who often referred to "The Book" in which God keeps...
Paul Erdős Award
The 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 chal...
Erdős–Kac theorem
In 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 ω(n) is the number of distinct pr...
Erdős–Kac theorem - Wikipedia
Erdős–Gallai theorem
The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches solving the graph realization problem, i.e. it gives a necessary an...
Erdős–Turán inequality
In 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 P...
List of conjectures by Paul Erdős
The prolific mathematician Paul Erdős and his various collaborators made many famous mathematical conjectures, over a wide field of subjects, and in many cases Erdős offered monetary rewards for solvi...
List of conjectures by Paul Erdős - Wikipedia
Erdős–Stone theorem
In 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. It is named after Pau...
N Is a Number: A Portrait of Paul Erdős
N Is a Number: A Portrait of Paul Erdős is a 1993 biographical documentary about the life of mathematician Paul Erdős, directed by George Paul Csicsery.The film was made between 1988 and 1991, captur...
Erdős–Ko–Rado theorem
In combinatorics, the Erdős–Ko–Rado theorem of Paul Erdős, Chao Ko, and Richard Rado is a theorem on intersecting set families. It is part of the theory of hypergraphs, specifically, uniform hypergra...
Erdős–Nagy theorem
The Erdős–Nagy theorem is a result in discrete geometry stating that a non-convex simple polygon can be made into a convex polygon by a finite sequence of flips. The flips are defined by taking a con...
Jon Folkman
Jon Hal Folkman (December 8, 1938 – January 23, 1969) was an American mathematician, a student of John Milnor, and a researcher at the RAND Corporation.
Folkman was a Putnam Fellow in 1960. He rec...
Erdős–Szekeres theorem
In 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 dis...
Erdős–Szekeres theorem - Wikipedia
Erdős–Faber–Lovász conjecture
In 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. It says:If k complet...
Erdős-Bacon number
A person's Erdős–Bacon number is the sum of one's Erdős number—which measures the "collaborative distance" in authoring mathematical papers between that person and Hungarian mathematician Paul Erdős—a...
Erdős distinct distances problem
In discrete geometry, the Erdős distinct distances problem states that between n distinct points on a plane there are at least n distinct distances. It was posed by Paul Erdős in 1946. In a 2010 prepr...
Erdős–Gyárfás conjecture
In 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 every graph with minimum degree 3 contain...
Erdős cardinal
In mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by Paul Erdős and András Hajnal (1958).The Erdős cardinal κ(α...
Erdős–Woods number
In number theory, a positive integer k is said to be an Erdős–Woods number if it has the following property:there exists a positive integer a such that in the sequence (a, a + 1, …, a + k) of consecut...
Zero-sum problem
In number theory, zero-sum problems are a certain class of combinatorial questions. In general, a finite abelian group G is considered. The zero-sum problem for the integer n is the following: Find th...