Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Erdős 546 found (1495 total)

alternate case: erdős

Paul Erdős (4,682 words) [view diff] exact match in snippet view article find links to article

Paul Erdős (Hungarian: Erdős Pál [ˈɛrdøːʃ ˈpaːl]; 26 March 1913 – 20 September 1996) was a renowned Hungarian mathematician. He was one of the most prolific
Erdős number (3,403 words) [view diff] exact match in snippet view article find links to article
The Erdős number (Hungarian: [ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship
Erdős–Rényi model (1,937 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, the Erdős–Rényi model is either of two closely related models for generating random graphs or the evolution
Erdős–Bacon number (1,208 words) [view diff] exact match in snippet view article find links to article
A person's Erdős–Bacon number is the sum of one's Erdős number—which measures the "collaborative distance" in authoring academic papers between that person
Erdős–Nicolas number (139 words) [view diff] exact match in snippet view article find links to article
an Erdős–Nicolas number is a number that is not perfect, but that equals one of the partial sums of its divisors. That is, a number n is Erdős–Nicolas
Erdős–Woods number (363 words) [view diff] exact match in snippet view article find links to article
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
Highly abundant number (498 words) [view diff] exact match in snippet view article find links to article
Pillai (1943), and early work on the subject was done by Alaoglu and Erdős (1944). Alaoglu and Erdős tabulated all highly abundant numbers up to 104, and showed
Superabundant number (691 words) [view diff] exact match in snippet view article find links to article
Superabundant numbers were defined by Leonidas Alaoglu and Paul Erdős (1944). Unknown to Alaoglu and Erdős, about 30 pages of Ramanujan's 1915 paper "Highly Composite
Square-free integer (3,265 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Powerful number (1,731 words) [view diff] exact match in snippet view article find links to article
Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such
Szemerédi's theorem (2,197 words) [view diff] exact match in snippet view article find links to article
concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural
List of people by Erdős number (5,428 words) [view diff] exact match in snippet view article find links to article
collaborators. The Erdős number measures the "collaborative distance" between an author and Erdős. Thus, his direct co-authors have Erdős number one, theirs
Primitive abundant number (278 words) [view diff] exact match in snippet view article find links to article
MathWorld. Erdős adopts a wider definition that requires a primitive abundant number to be not deficient, but not necessarily abundant (Erdős, Surányi and
Erdős–Borwein constant (434 words) [view diff] exact match in snippet view article find links to article
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:
Ronald Graham (4,118 words) [view diff] exact match in snippet view article find links to article
concept of the Erdős number, a measure of distance from Erdős in the collaboration network of mathematicians; his many works with Erdős include two books
Probabilistic method (1,814 words) [view diff] exact match in snippet view article find links to article
nonconstructive method, primarily used in combinatorics and pioneered by Paul Erdős, for proving the existence of a prescribed kind of mathematical object.
Erdős–Gyárfás conjecture (444 words) [view diff] exact match in snippet view article find links to article
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
Erdős Prize (210 words) [view diff] exact match in snippet view article find links to article
The Anna and Lajos Erdős Prize in Mathematics is a prize given by the Israel Mathematical Union to an Israeli mathematician (in any field of mathematics
De Bruijn–Erdős theorem (graph theory) (3,403 words) [view diff] exact match in snippet view article
In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that,
Random graph (2,368 words) [view diff] exact match in snippet view article find links to article
In a mathematical context, random graph refers almost exclusively to the Erdős–Rényi random graph model. In other contexts, any graph model may be referred
List of conjectures by Paul Erdős (973 words) [view diff] exact match in snippet view article find links to article
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
Éva Erdős (64 words) [view diff] exact match in snippet view article find links to article
Éva Erdős (born 28 July 1964 in Budapest) is a Hungarian handball player who competed in the 1996 Summer Olympics and won the bronze medal with the Hungarian
List of unsolved problems in mathematics (12,389 words) [view diff] exact match in snippet view article find links to article
Hilbert's twelfth problem Carmichael's totient function conjecture Erdős–Straus conjecture Erdős–Ulam problem Pillai's conjecture Hall's conjecture Lindelöf
Erdős–Straus conjecture (3,140 words) [view diff] exact match in snippet view article find links to article
In 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 positive
De Bruijn–Erdős theorem (incidence geometry) (406 words) [view diff] exact match in snippet view article
incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős (1948), states a lower bound on the
Proofs from THE BOOK (443 words) [view diff] exact match in snippet view article find links to article
Paul Erdős, who often referred to "The Book" in which God keeps the most elegant proof of each mathematical theorem. During a lecture in 1985, Erdős said
Colossally abundant number (1,284 words) [view diff] exact match in snippet view article find links to article
in a slightly stronger form in a 1944 paper of Leonidas Alaoglu and Paul Erdős in which they tried to extend Ramanujan's results. Colossally abundant numbers
Erdős–Szekeres theorem (1,172 words) [view diff] exact match in snippet view article find links to article
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
Erdős–Faber–Lovász conjecture (1,322 words) [view diff] exact match in snippet view article find links to article
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
Erdős–Kac theorem (901 words) [view diff] exact match in snippet view article find links to article
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
Menger's theorem (1,556 words) [view diff] exact match in snippet view article find links to article
Berger was originally a conjecture proposed by Paul Erdős, and before being proved was known as the Erdős–Menger conjecture. It is equivalent to Menger's
Béla Bollobás (1,533 words) [view diff] exact match in snippet view article find links to article
Paul Erdős since the age of 14. As a student, he took part in the first three International Mathematical Olympiads, winning two gold medals. Paul Erdős invited
Happy ending problem (1,656 words) [view diff] exact match in snippet view article find links to article
The "happy ending problem" (so named by Paul Erdős because it led to the marriage of George Szekeres and Esther Klein) is the following statement: Theorem:
Erdős–Mordell inequality (1,028 words) [view diff] exact match in snippet view article find links to article
In Euclidean geometry, the Erdős–Mordell inequality states that for any triangle ABC and point P inside ABC, the sum of the distances from P to the sides
Lesnica (Slovakia) (41 words) [view diff] exact match in snippet view article
Lesnica (Hungarian: Erdős, Lesnicz) is a large village and municipality in the Stará Ľubovňa District in the Prešov Region of northern Slovakia. In historical
Erdős–Graham problem (436 words) [view diff] exact match in snippet view article find links to article
In combinatorial number theory, the Erdős–Graham problem is the problem of proving that, if the set { 2 , 3 , 4 , … } {\displaystyle \{2,3,4,\dots \}}
Burr–Erdős conjecture (846 words) [view diff] exact match in snippet view article find links to article
the Burr–Erdős conjecture was a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Stefan Burr and Paul Erdős, and is
Beck's theorem (geometry) (1,076 words) [view diff] exact match in snippet view article
two points of point set is said to be determined by that point set.) The Erdős–Beck theorem is a variation of a classical result by L. M. Kelly and W.
Copeland–Erdős constant (560 words) [view diff] exact match in snippet view article find links to article
The Copeland–Erdős constant is the concatenation of "0." with the base 10 representations of the prime numbers in order. Its value, using the modern definition
Erdős–Rado theorem (202 words) [view diff] exact match in snippet view article find links to article
calculus, part of combinatorial set theory, a branch of mathematics, the Erdős–Rado theorem is a basic result extending Ramsey's theorem to uncountable
Erdős–Ko–Rado theorem (1,282 words) [view diff] exact match in snippet view article find links to article
In combinatorics, the Erdős–Ko–Rado theorem of Paul Erdős, Chao Ko, and Richard Rado is a theorem on intersecting set families. The theorem is as follows
Zero-sum problem (453 words) [view diff] exact match in snippet view article find links to article
that sum to 0. The classic result in this area is the 1961 theorem of Paul Erdős, Abraham Ginzburg, and Abraham Ziv. They proved that for the group Z / n
Erdős conjecture on arithmetic progressions (558 words) [view diff] exact match in snippet view article find links to article
Erdős' conjecture on arithmetic progressions, often referred to as the Erdős–Turán conjecture, is a conjecture in arithmetic combinatorics (not to be confused
List of things named after Paul Erdős (211 words) [view diff] exact match in snippet view article find links to article
Paul Erdős: Paul Erdős Award of the World Federation of National Mathematics Competitions Erdős Prize Erdős Lectures Erdős number Erdős cardinal Erdős–Nicolas
Pál Turán (1,181 words) [view diff] exact match in snippet view article find links to article
theory. He had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers. Turán was born into
Fan Chung (2,243 words) [view diff] exact match in snippet view article find links to article
extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree distribution (including power-law
Sign sequence (646 words) [view diff] exact match in snippet view article find links to article
commonly studied in discrepancy theory. Around 1932, mathematician Paul Erdős conjectured that for any infinite ±1-sequence ⟨ x 1 , x 2 , … ⟩ {\displaystyle
The Man Who Loved Only Numbers (542 words) [view diff] exact match in snippet view article find links to article
Who Loved Only Numbers is a biography of the famous mathematician Paul Erdős written by Paul Hoffman. The book was first published on July 15, 1998,
Erdős–Hajnal conjecture (646 words) [view diff] exact match in snippet view article find links to article
In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either
The Man Who Loved Only Numbers (542 words) [view diff] exact match in snippet view article find links to article
Who Loved Only Numbers is a biography of the famous mathematician Paul Erdős written by Paul Hoffman. The book was first published on July 15, 1998,
Erdős Lectures (230 words) [view diff] exact match in snippet view article find links to article
Erdős Lectures in Discrete Mathematics and Theoretical Computer Science is a distinguished lecture series at Hebrew University of Jerusalem named after
Arithmetic number (288 words) [view diff] exact match in snippet view article find links to article
condition that d(N)2 divides σ(N) is 1/2. Guy (2004) p.76 Bateman, Paul T.; Erdős, Paul; Pomerance, Carl; Straus, E.G. (1981). "The arithmetic mean of the
Hungary women's national handball team (2,334 words) [view diff] exact match in snippet view article find links to article
(Eighth placed) Mária Ácsbog, Ildikó Barna, Erika Csapó, Csilla Elekes, Éva Erdős, Marianna Nagy, Erzsébet Németh, Anna György, Éva Kiss, Éva Kovács, Katalin
Pillai prime (175 words) [view diff] exact match in snippet view article find links to article
these numbers. Their infinitude has been proved several times, by Subbarao, Erdős, and Hardy & Subbarao. Guy, R. K. (2004), Unsolved Problems in Number Theory
Collaboration graph (1,086 words) [view diff] exact match in snippet view article find links to article
graphs include: Collaboration graph of mathematicians also known as the Erdős collaboration graph, where two mathematicians are joined by an edge whenever
Cameron–Erdős conjecture (246 words) [view diff] exact match in snippet view article find links to article
In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in | N | = { 1 , … , N } {\displaystyle
De Bruijn–Erdős theorem (20 words) [view diff] exact match in snippet view article find links to article
The De Bruijn–Erdős theorem may refer to: De Bruijn–Erdős theorem (incidence geometry) De Bruijn–Erdős theorem (graph theory)
List of scientific laws named after people (103 words) [view diff] exact match in snippet view article find links to article
Paul Erdős and József Beck Erdős–Gallai theorem Mathematics Paul Erdős and Tibor Gallai Erdős–Kac theorem Mathematics Paul Erdős and Mark Kac Erdős–Ko–Rado
Erdős–Stone theorem (701 words) [view diff] exact match in snippet view article find links to article
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
Egyptian fraction (4,745 words) [view diff] exact match in snippet view article find links to article
chapter II.7 Erdős (1932); Graham (2013) Butler, Erdős & Graham (2015). See Wagon (1999) and Beeckmans (1993) Yokota (1988). Vose (1985). Erdős (1950). Tenenbaum
Probabilistic number theory (175 words) [view diff] exact match in snippet view article find links to article
analytic number theory. Foundational results include the Erdős–Wintner theorem and the Erdős–Kac theorem on additive functions. Number theory Analytic
Clique (graph theory) (2,388 words) [view diff] exact match in snippet view article
back at least to the graph-theoretic reformulation of Ramsey theory by Erdős & Szekeres (1935), the term clique comes from Luce & Perry (1949), who used
Richard Rado (429 words) [view diff] exact match in snippet view article find links to article
Paul Erdős, and Alfréd Rényi. In combinatorial set theory, the Erdős–Rado theorem extends Ramsey's theorem to infinite sets. It was published by Erdős and
Arthur Rubin (773 words) [view diff] exact match in snippet view article find links to article
Rubin co-authored a paper on list coloring of graphs with Paul Erdős, giving him an Erdős number of 1. Rubin, A. L. & Rubin, J. E. (1969). "Extended operations
Erdős–Turán inequality (455 words) [view diff] exact match in snippet view article find links to article
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
Jeff Westbrook (414 words) [view diff] exact match in snippet view article find links to article
for AT&T Laboratories before leaving research for Hollywood. Westbrook's Erdős number is three due to his research collaborations with Tarjan and others
Paul Erdős Award (238 words) [view diff] exact match in snippet view article find links to article
The Paul Erdős Award, named after Paul Erdős, is given by the World Federation of National Mathematics Competitions for those who "have played a significant
Untouchable number (672 words) [view diff] exact match in snippet view article find links to article
are infinitely many untouchable numbers, a fact that was proven by Paul Erdős. According to Chen & Zhao, their natural density is at least d > 0.06. Aliquot
Triangle-free graph (1,865 words) [view diff] exact match in snippet view article find links to article
relating coloring to minimum degree in triangle-free graphs. Andrásfai, Erdős & Sós (1974) proved that any n-vertex triangle-free graph in which each
Restricted sumset (1,153 words) [view diff] exact match in snippet view article find links to article
theorem generalises this to general abelian groups. The Erdős–Heilbronn conjecture posed by Paul Erdős and Hans Heilbronn in 1964 states that | 2 ∧ A | ≥ min
Erdős–Pósa theorem (680 words) [view diff] exact match in snippet view article find links to article
In the mathematical discipline of graph theory, the Erdős–Pósa theorem, named after Paul Erdős and Lajos Pósa, states that there is a function f(k) such
Erdős–Fuchs theorem (1,649 words) [view diff] exact match in snippet view article find links to article
In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented
Hemiperfect number (109 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Arcsine distribution (594 words) [view diff] exact match in snippet view article find links to article
distribution. The arcsine distribution appears in the Lévy arcsine law; in the Erdős arcsine law; as the Jeffreys prior for the probability of success of a Bernoulli
Alexander Soifer (539 words) [view diff] exact match in snippet view article find links to article
2006 at the University of Cambridge, Soifer was presented with the Paul Erdős Award by the World Federation of National Mathematics Competitions. Soifer
Erdős distinct distances problem (871 words) [view diff] exact match in snippet view article find links to article
In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances
Richard K. Guy (3,055 words) [view diff] exact match in snippet view article find links to article
before." Eventually he wrote four papers with Erdős, giving him an Erdős number of 1, and solved one of Erdős' problems. Guy was intrigued by unsolved problems
András Hajnal (1,860 words) [view diff] exact match in snippet view article find links to article
also proves a conjecture of Erdős and Gallai on the number of edges in a critical graph for domination. A paper with Erdős on graph coloring problems for
Small-world experiment (3,266 words) [view diff] exact match in snippet view article find links to article
important in sociology and anthropology Erdős number – Closeness of someone's association with mathematician Paul Erdős Erdős–Bacon number – Closeness of someone's
Endre Szemerédi (1,200 words) [view diff] exact match in snippet view article find links to article
science, including Szemerédi's theorem, the Szemerédi regularity lemma, the Erdős–Szemerédi theorem, the Hajnal–Szemerédi theorem and the Szemerédi–Trotter
Erdős cardinal (343 words) [view diff] exact match in snippet view article find links to article
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)
Erdős–Turán conjecture on additive bases (1,663 words) [view diff] exact match in snippet view article find links to article
The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed
Sublime number (131 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Márta Tolnai-Erdős (60 words) [view diff] exact match in snippet view article find links to article
Márta Tolnai-Erdős (23 August 1941 – 5 July 2012) was a Hungarian gymnast. She competed at the 1964 Summer Olympics and the 1968 Summer Olympics. Evans
Six degrees of separation (5,200 words) [view diff] exact match in snippet view article find links to article
collaboration distance with mathematician Paul Erdős is called the Erdős number. Erdős-Bacon numbers and Erdős-Bacon-Sabbath (EBS) numbers are further extensions
Smarandache–Wellin number (311 words) [view diff] exact match in snippet view article find links to article
next Smarandache–Wellin prime (if one exists) is at least 22077. Copeland–Erdős constant Pomerance, Carl B.; Crandall, Richard E. (2001). Prime Numbers:
Erdős–Diophantine graph (401 words) [view diff] exact match in snippet view article find links to article
An Erdős–Diophantine graph is an object in the mathematical subject of Diophantine equations consisting of a set of integer points at integer distances
Infinitary combinatorics (729 words) [view diff] exact match in snippet view article find links to article
κ, λ for ordinals, m for a cardinal number and n for a natural number. Erdős & Rado (1956) introduced the notation κ → ( λ ) m n {\displaystyle \kappa
Mathematical beauty (3,170 words) [view diff] exact match in snippet view article find links to article
highest excellence, is to be found in mathematics as surely as poetry. Paul Erdős expressed his views on the ineffability of mathematics when he said, "Why
Erdős–Szemerédi theorem (524 words) [view diff] exact match in snippet view article find links to article
In arithmetic combinatorics, the Erdős–Szemerédi theorem, proven by Paul Erdős and Endre Szemerédi in 1983, states that, for every finite set of real
Erdős–Nagy theorem (561 words) [view diff] exact match in snippet view article find links to article
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
Maximum-entropy random graph model (1,421 words) [view diff] exact match in snippet view article find links to article
maximum-entropy distribution is determined. We exemplify this with the Erdős–Rényi model G ( n , m ) {\displaystyle G(n,m)} . The sharp constraint in
Michel Deza (1,299 words) [view diff] exact match in snippet view article find links to article
with 75 different co-authors, including four papers with Paul Erdős, giving him an Erdős number of 1. The papers from a conference on combinatorics, geometry
Vera T. Sós (827 words) [view diff] exact match in snippet view article find links to article
and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál
Frugal number (284 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Rough number (189 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Gompertz distribution (1,308 words) [view diff] exact match in snippet view article find links to article
for customer lifetime value modeling. In network theory, particularly the Erdős–Rényi model, the walk length of a random self-avoiding walk (SAW) is distributed
N is a Number: A Portrait of Paul Erdős (131 words) [view diff] exact match in snippet view article find links to article
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
Mark Kac (1,269 words) [view diff] exact match in snippet view article find links to article
independence. Paul Erdős was in the audience and soon finished the proof using sieve theory, and the result became known as the Erdős–Kac theorem. They
Carmichael number (3,220 words) [view diff] exact match in snippet view article find links to article
is an open question (though it is implied by Dickson's conjecture). Paul Erdős heuristically argued there should be infinitely many Carmichael numbers
Paley graph (1,580 words) [view diff] exact match in snippet view article find links to article
independently by Sachs (1962) and Erdős & Rényi (1963). Sachs was interested in them for their self-complementarity properties, while Erdős and Rényi studied their
Extravagant number (279 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Degeneracy (graph theory) (3,590 words) [view diff] exact match in snippet view article
than the maximum degree. The coloring number of a graph G was defined by Erdős & Hajnal (1966) to be the least κ for which there exists an ordering of
Erdős–Anning theorem (646 words) [view diff] exact match in snippet view article find links to article
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
Sphenic number (431 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Erdős–Ulam problem (642 words) [view diff] exact match in snippet view article find links to article
In mathematics, the Erdős–Ulam problem asks whether the plane contains a dense set of points whose Euclidean distances are all rational numbers. It is
Nicholas Metropolis (1,113 words) [view diff] exact match in snippet view article find links to article
wonderful personality." Metropolis has an Erdős number of 2 and he enabled Richard Feynman to have an Erdős number of 3. Stochastics ENIAC Colossus computer
George B. Purdy (716 words) [view diff] exact match in snippet view article find links to article
University of Cincinnati in 1986. Purdy had Erdős number one and coauthored many papers with Paul Erdős, who regarded him as his own student.[citation
Ralph Faudree (447 words) [view diff] exact match in snippet view article find links to article
for his contributions to combinatorics. His Erdős number was 1: he cowrote 50 joint papers with Paul Erdős beginning in 1976 and was among the three mathematicians
Primary pseudoperfect number (541 words) [view diff] exact match in snippet view article find links to article
(2017), "Primary pseudoperfect numbers, arithmetic progressions, and the Erdős-Moser equation", The American Mathematical Monthly, 124 (3): 232–240, arXiv:1812
Erdős–Gallai theorem (1,242 words) [view diff] exact match in snippet view article find links to article
The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches to solving the graph
Pál Sarudi (198 words) [view diff] exact match in snippet view article find links to article
Szolnoki Sportcentrum Nonprofit Kft. Canoe Club and is coached by Attila Erdős. ICF medalists for Olympic and World Championships – Part 1: flatwater (now
Erdős–Rényi Prize (356 words) [view diff] exact match in snippet view article find links to article
The Erdős–Rényi Prize of the Network Science Society is named for Paul Erdős and Alfréd Rényi. This international prize is awarded annually in a special
Equidigital number (282 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Composite number (851 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Cecil C. Rousseau (171 words) [view diff] exact match in snippet view article find links to article
University. He has an Erdős number of 1, and is Erdős' 5th most common co-author, with 35 joint papers. In 2012, Rousseau received the Paul Erdős Award from the
Peter Bergmann (460 words) [view diff] exact match in snippet view article find links to article
John Boardman and Rainer K. Sachs. Bergmann had an Erdős number of 2 (via Ernst G. Straus to Paul Erdős). Paul Halpern, Desperately Seeking Einstein’s Assistant
Paul Erdős Prize (48 words) [view diff] exact match in snippet view article find links to article
The Paul Erdős Prize (formerly Mathematical Prize) is given to Hungarian mathematicians not older than 40 by the Mathematics Department of the Hungarian
Combinatorica (408 words) [view diff] exact match in snippet view article find links to article
with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are László Babai
Betrothed numbers (315 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Daniel Kleitman (841 words) [view diff] exact match in snippet view article find links to article
University, Kleitman was encouraged by Paul Erdős to change his field of study to mathematics. Perhaps humorously, Erdős once asked him, "Why are you only a physicist
Power of three (857 words) [view diff] exact match in snippet view article find links to article
contain an arithmetic progression of three elements. A conjecture of Paul Erdős states that this sequence contains no powers of two other than 1, 4, and
List of scientific constants named after people (506 words) [view diff] exact match in snippet view article find links to article
Champernowne Chandrasekhar limit – Subrahmanyan Chandrasekhar Copeland–Erdős constant – Paul Erdős and Peter Borwein Coulomb constant (electric force constant,
Watts–Strogatz model (1,581 words) [view diff] exact match in snippet view article find links to article
dates back to the work of Paul Erdős and Alfréd Rényi. The graphs they considered, now known as the classical or Erdős–Rényi (ER) graphs, offer a simple
Deficient number (377 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Hsu–Robbins–Erdős theorem (268 words) [view diff] exact match in snippet view article find links to article
In the mathematical theory of probability, the Hsu–Robbins–Erdős theorem states that if X 1 , … , X n {\displaystyle X_{1},\ldots ,X_{n}} is a sequence
John Adrian Bondy (488 words) [view diff] exact match in snippet view article find links to article
Bondy–Chvátal theorem together with Václav Chvátal. His coauthors include Paul Erdős. Bondy received his Ph.D. in graph theory from University of Oxford in 1969
Tibor Gallai (174 words) [view diff] exact match in snippet view article find links to article
especially in graph theory, and was a lifelong friend and collaborator of Paul Erdős. He was a student of Dénes Kőnig and an advisor of László Lovász. He was
Small-world network (4,412 words) [view diff] exact match in snippet view article find links to article
important in sociology and anthropology Erdős number – Closeness of someone's association with mathematician Paul Erdős Erdős–Rényi (ER) model – Two closely related
Viktor Erdős (60 words) [view diff] exact match in snippet view article find links to article
Viktor Erdős (born 2 September 1987) is a Hungarian chess grandmaster. He won the Hungarian Chess Championship in 2011. Erdős was awarded the grandmaster
Six Degrees of Kevin Bacon (1,946 words) [view diff] exact match in snippet view article find links to article
she has from Bacon, as defined by the game. This is an application of the Erdős number concept to the Hollywood movie industry. The higher the Bacon number
Semiprime (796 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Hadwiger conjecture (graph theory) (1,959 words) [view diff] exact match in snippet view article
made by Hugo Hadwiger in 1943 and is still unsolved. Bollobás, Catlin & Erdős (1980) call it “one of the deepest unsolved problems in graph theory.” An
Achilles number (411 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Quasiperfect number (385 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Ágnes Hankiss (39 words) [view diff] exact match in snippet view article find links to article
Ágnes Hankiss (orig. Ágnes Erdős born 7 March 1950 in Budapest) is a Hungarian politician and elected Member of the European Parliament (MEP) with Fidesz
Tournament (graph theory) (2,334 words) [view diff] exact match in snippet view article
guaranteed (Erdős & Moser 1964). However, Reid & Parker (1970) showed that this bound is not tight for some larger values of  n {\displaystyle n} . Erdős & Moser
Ramsey's theorem (5,217 words) [view diff] exact match in snippet view article find links to article
MR 2552114. Erdős, Paul (1947), "Some remarks on the theory of graphs", Bull. Amer. Math. Soc., 53 (4): 292–294, doi:10.1090/S0002-9904-1947-08785-1. Erdős, P
List of number theory topics (938 words) [view diff] exact match in snippet view article find links to article
cryptanalysis Multiplicative function Additive function Dirichlet convolution Erdős–Kac theorem Möbius function Möbius inversion formula Divisor function Liouville
Centered dodecahedral number (62 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of large cardinal properties (501 words) [view diff] exact match in snippet view article find links to article
ineffable cardinals remarkable cardinals α-Erdős cardinals (for countable α), 0# (not a cardinal), γ-iterable, γ-Erdős cardinals (for uncountable γ) almost
Erdős–Tetali theorem (1,639 words) [view diff] exact match in snippet view article find links to article
In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order
Wolstenholme number (59 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Centered polyhedral number (75 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Lajos Pósa (mathematician) (1,257 words) [view diff] exact match in snippet view article
competence. That is how Pósa’s first paper was born, co-authored with Erdős (hence his Erdős number is 1). He went to the first special mathematics class of
Incidence geometry (3,261 words) [view diff] exact match in snippet view article find links to article
configuration. A related result is the de Bruijn–Erdős theorem. Nicolaas Govert de Bruijn and Paul Erdős proved the result in the more general setting of
András Sárközy (132 words) [view diff] exact match in snippet view article find links to article
has the largest number of papers co-authored with Paul Erdős (a total of 62); he has an Erdős number of one. He proved the Furstenberg–Sárközy theorem
Ke Zhao (136 words) [view diff] exact match in snippet view article find links to article
Some of his major contributions included his work on quadratic forms, the Erdős–Ko–Rado theorem and his theorem on Catalan's conjecture. He was later a
Centered polyhedral number (75 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Smith number (579 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Pernicious number (269 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Peter Winkler (467 words) [view diff] exact match in snippet view article find links to article
Mathematical Truth", Paul Erdős attended the bar mitzvah celebration for Peter Winkler's twins, and Winkler's mother-in-law tried to throw Erdős out. [Quote:] "Erdös
Catalan pseudoprime (141 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Erdős arcsine law (126 words) [view diff] exact match in snippet view article find links to article
In number theory, the Erdős arcsine law, named after Paul Erdős, states that the prime divisors of a number have a distribution related to the arcsine
Richard Schelp (239 words) [view diff] exact match in snippet view article find links to article
retired in 2001. Schelp, an Erdős number one mathematician, was the fourth most frequent scholarly collaborator with Paul Erdős. He also collaborated on
Carmichael function (1,865 words) [view diff] exact match in snippet view article find links to article
in Erdős (1991) Sándor & Crstici (2004) p.194 Theorem 2 in Erdős (1991) 3. Normal order. (p.365) Theorem 5 in Friedlander (2001) Theorem 1 in Erdős 1991
Network science (9,812 words) [view diff] exact match in snippet view article find links to article
theory in network science developed as an offshoot of graph theory with Paul Erdős and Alfréd Rényi's eight famous papers on random graphs. For social networks
Loeschian number (112 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Erdős–Moser equation (339 words) [view diff] exact match in snippet view article find links to article
In number theory, the Erdős–Moser equation is 1 k + 2 k + ⋯ + m k = ( m + 1 ) k {\displaystyle 1^{k}+2^{k}+\cdots +m^{k}=(m+1)^{k}} where m {\displaystyle
Pronic number (759 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Tom Porter (computer scientist) (1,160 words) [view diff] exact match in snippet view article
and also featuring Tom Hanks) List of Pixar staff List of people by Erdős number Erdős–Bacon number Porter, Thomas K; Simon, István (1975). "Random Insertion
Erdős space (396 words) [view diff] exact match in snippet view article find links to article
In mathematics, Erdős space is a topological space named after Paul Erdős, who described it in 1940. Erdős space is defined as a subspace E ⊂ ℓ 2 {\displaystyle
Maker-Breaker game (3,284 words) [view diff] exact match in snippet view article find links to article
potential-sum weakly decreases, then this is a winning strategy for Breaker. Paul Erdős and John Selfridge presented a general condition that guarantees Breaker
Polynomial lemniscate (477 words) [view diff] exact match in snippet view article find links to article
polynomial of degree 2 then the curve is a Cassini oval. A conjecture of Erdős which has attracted considerable interest concerns the maximum length of
Arthur Herbert Copeland (325 words) [view diff] exact match in snippet view article find links to article
interest was in the foundations of probability. He worked with Paul Erdős on the Copeland-Erdős constant. His son, Arthur Herbert Copeland, Jr., is also a mathematician
Normal number (4,269 words) [view diff] exact match in snippet view article find links to article
but they have not been proven to be normal in other bases. The Copeland–Erdős constant 0.23571113171923293137414347535961677173798389..., obtained by
George Szekeres (642 words) [view diff] exact match in snippet view article find links to article
with many prominent mathematicians throughout his life, including Paul Erdős, Esther Szekeres (née Esther Klein), Pál Turán, Béla Bollobás, Ronald Graham
Stefan Burr (279 words) [view diff] exact match in snippet view article find links to article
He has published 27 papers with Paul Erdős. The Burr–Erdős conjecture, published as a conjecture by Burr and Erdős in 1975, solved only in 2015, states
Ernst G. Straus (357 words) [view diff] exact match in snippet view article find links to article
functions. His extensive list of co-authors includes Albert Einstein, Paul Erdős, Richard Bellman, Béla Bollobás, Sarvadaman Chowla, Ronald Graham, Lee Albert
Terence Tao (4,782 words) [view diff] exact match in snippet view article find links to article
2019, Tao has published nearly 350 research papers and 18 books. He has an Erdős number of 2. In 2018, Tao proved bounding for the de Bruijn–Newman constant
Arthur Harold Stone (233 words) [view diff] exact match in snippet view article find links to article
first paper dealt with squaring the square, he proved the Erdős–Stone theorem with Paul Erdős and is credited with the discovery of the first two flexagons
Superperfect number (395 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Erdős–Dushnik–Miller theorem (664 words) [view diff] exact match in snippet view article find links to article
In the mathematical theory of infinite graphs, the Erdős–Dushnik–Miller theorem is a form of Ramsey's theorem stating that every infinite graph contains
Unit distance graph (1,477 words) [view diff] exact match in snippet view article find links to article
Erdős, Paul (1946), "On sets of distances of n points", American Mathematical Monthly, 53 (5): 248–250, doi:10.2307/2305092, JSTOR 2305092. Erdős, Paul;
List of fellows of the Royal Society elected in 1989 (575 words) [view diff] exact match in snippet view article find links to article
(1927–2010) Sir Andrew John Wiles Ian Robert Young Nicole Marthe Le Douarin Paul Erdős (1913–1996) Kenichi Fukui (1918–1998) Edward B Lewis (1918–2004) Barbara
Evil number (318 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Joel Spencer (274 words) [view diff] exact match in snippet view article find links to article
University. In 1984 Spencer received a Lester R. Ford Award. He was an Erdős Lecturer at Hebrew University of Jerusalem in 2001. In 2012 he became a
Erdős–Tenenbaum–Ford constant (318 words) [view diff] exact match in snippet view article find links to article
The Erdős–Tenenbaum–Ford constant is a mathematical constant that appears in number theory. Named after mathematicians Paul Erdős, Gérald Tenenbaum, and
Mirsky's theorem (1,119 words) [view diff] exact match in snippet view article find links to article
theorem relating longest paths and colorings in graphs, and to the Erdős–Szekeres theorem on monotonic subsequences. The height of a partially ordered
Krishnaswami Alladi (322 words) [view diff] exact match in snippet view article find links to article
wrote to Paul Erdős concerning his research on the function that maps each integer to the sum of its prime factors (with repetition); Erdős came to Madras
Almost perfect number (470 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Richárd Erdős (190 words) [view diff] exact match in snippet view article find links to article
Richárd Erdős (Brno, 18 May 1881 - Frankfurt, 9 June 1912) was a Jewish Hungarian bass opera singer who was father of the American children's author Richard
Icosahedral number (193 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Erdős sumset conjecture (162 words) [view diff] exact match in snippet view article find links to article
In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset A {\displaystyle A} of the natural numbers N {\displaystyle
Large set (combinatorics) (684 words) [view diff] exact match in snippet view article
reciprocals converges. Large sets appear in the Müntz–Szász theorem and in the Erdős conjecture on arithmetic progressions. Every finite subset of the positive
Critical graph (661 words) [view diff] exact match in snippet view article find links to article
has only one component. G is finite (this is the de Bruijn–Erdős theorem of de Bruijn & Erdős 1951). δ(G) ≥ k − 1, that is, every vertex is adjacent to
Noncototient (797 words) [view diff] exact match in snippet view article find links to article
3, 1, 8, 4, 6, 1, 3, 1, 5, 2, 7, 3, ... (sequence A063740 in the OEIS) Erdős (1913-1996) and Sierpinski (1882-1969) asked whether there exist infinitely
András Gyárfás (156 words) [view diff] exact match in snippet view article find links to article
is famous for two conjectures: Together with Paul Erdős he conjectured what is now called the Erdős–Gyárfás conjecture which states that any graph with
Sorting number (430 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Degree (graph theory) (1,087 words) [view diff] exact match in snippet view article
is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm. The problem of finding or
Highly composite number (1,593 words) [view diff] exact match in snippet view article find links to article
Q(x)\leq (\log x)^{b}\,.} The first part of the inequality was proved by Paul Erdős in 1944 and the second part by Jean-Louis Nicolas in 1988. We have 1.13862
Percolation theory (3,247 words) [view diff] exact match in snippet view article find links to article
{\displaystyle p_{c}} is equal to 1 / ( z − 1 ) {\displaystyle 1/(z-1)} . For random Erdős–Rényi networks of average degree ⟨ k ⟩ {\displaystyle \langle k\rangle }
Perfect power (1,026 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Samuel S. Wagstaff Jr. (272 words) [view diff] exact match in snippet view article find links to article
authored/coauthored over 50 research papers and three books. He has an Erdős number of 1. Wagstaff received his Bachelor of Science in 1966 from Massachusetts
Somer–Lucas pseudoprime (236 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Netsci Conference (1,538 words) [view diff] exact match in snippet view article find links to article
Wang Erdős–Rényi Prize 2017 Young Network Scientist Award Vittoria Colizza Albert-László Barabási Janos Kertesz Jeong Han Kim Olaf Sporns Erdős–Rényi
Miklós Simonovits (616 words) [view diff] exact match in snippet view article find links to article
error. Simonovits was also one of the most frequent collaborators with Paul Erdős, co-authoring 21 papers with him. He began his university studies at the
Sierpiński number (1,379 words) [view diff] exact match in snippet view article find links to article
of the smallest Sierpiński number. In private correspondence with Paul Erdős, Selfridge conjectured that 78,557 was the smallest Sierpiński number. No
List of network scientists (173 words) [view diff] exact match in snippet view article find links to article
Trey Ideker Bernhard Palsson Olaf Sporns Vincent Blondel Béla Bollobás Pául Erdős Frank Harary László Lovász Alfréd Rényi Steven Strogatz Mason Porter
Centered tetrahedral number (83 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Miklós Simonovits (616 words) [view diff] exact match in snippet view article find links to article
error. Simonovits was also one of the most frequent collaborators with Paul Erdős, co-authoring 21 papers with him. He began his university studies at the
Highly composite number (1,593 words) [view diff] exact match in snippet view article find links to article
Q(x)\leq (\log x)^{b}\,.} The first part of the inequality was proved by Paul Erdős in 1944 and the second part by Jean-Louis Nicolas in 1988. We have 1.13862
Pay it forward (2,520 words) [view diff] exact match in snippet view article find links to article
mathematician Paul Erdős heard about a promising math student unable to enroll in Harvard University for financial reasons. Erdős contributed enough to
Sidon sequence (808 words) [view diff] exact match in snippet view article find links to article
Despite a large body of research, the question remained unsolved. Paul Erdős and Pál Turán proved that, for every x > 0, the number of elements smaller
Heptagonal pyramidal number (124 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of theorems (5,628 words) [view diff] exact match in snippet view article find links to article
(ergodic theory) Erdős–Anning theorem (discrete geometry) Erdős–Dushnik–Miller theorem (set theory) Erdős–Gallai theorem (graph theory) Erdős–Ginzburg–Ziv
Centered heptagonal number (176 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Klaus Roth (3,409 words) [view diff] exact match in snippet view article find links to article
arithmetic progression. These sequences had been studied in 1936 by Paul Erdős and Pál Turán, who conjectured that they must be sparse. However, in 1942
Centered icosahedral number (94 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Abundant number (948 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Chung–Erdős inequality (212 words) [view diff] exact match in snippet view article find links to article
In probability theory, the Chung–Erdős inequality provides a lower bound on the probability that one out of many (possibly dependent) events occurs. The
Edgar Gilbert (1,704 words) [view diff] exact match in snippet view article find links to article
Gilbert–Elliott model of bursty errors in signal transmission, and the Erdős–Rényi model for random graphs. Gilbert was born in 1923 in Woodhaven, New
Alfréd Rényi (886 words) [view diff] exact match in snippet view article find links to article
packing. He wrote 32 joint papers with Paul Erdős, the most well-known of which are his papers introducing the Erdős–Rényi model of random graphs. Rényi, who
Rado graph (4,487 words) [view diff] exact match in snippet view article find links to article
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with
Superior highly composite number (676 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Dodecahedral number (195 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of Hungarian mathematicians (435 words) [view diff] exact match in snippet view article find links to article
László (1950–present), Paul Erdős Prize Bárány Imre (1947–present), Paul Erdős Prize Beck József (1952–present), Paul Erdős Prize Bollobás Béla (1943–present)
Dorottya Erdős (359 words) [view diff] exact match in snippet view article find links to article
Dorottya Erdős (born 3 April 1979 in Budapest) is a Hungarian sport shooter. She finished fifth in sport pistol shooting at the 2003 European Championships
Pentagonal pyramidal number (160 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Harmonic divisor number (956 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Hexagonal pyramidal number (82 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Erdős on Graphs (500 words) [view diff] exact match in snippet view article find links to article
Erdős on Graphs: His Legacy of Unsolved Problems is a book on unsolved problems in mathematics collected by Paul Erdős in the area of graph theory. It
Elliptic pseudoprime (155 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Andrew Granville (403 words) [view diff] exact match in snippet view article find links to article
Carmichael numbers in 1994. This proof was based on a conjecture given by Paul Erdős. Granville won a Lester R. Ford Award in 2007 and again in 2009. In 2008
Heptagonal number (319 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Amicable numbers (2,015 words) [view diff] exact match in snippet view article find links to article
by Thabit's formula (above), nor by any similar formula. In 1955, Paul Erdős showed that the density of amicable numbers, relative to the positive integers
Hyperperfect number (692 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Centered octagonal number (193 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of inequalities (693 words) [view diff] exact match in snippet view article find links to article
theorem Clifford's theorem on special divisors Cohn-Vossen's inequality Erdős–Mordell inequality Euler's theorem in geometry Gromov's inequality for complex
Power of 10 (593 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Jon Folkman (1,066 words) [view diff] exact match in snippet view article find links to article
Paul Erdős. After his brain surgery, Folkman was despairing that he had lost his mathematical skills. As soon as Folkman received Graham and Erdős at the
Chang's conjecture (249 words) [view diff] exact match in snippet view article find links to article
the consistency of an ω1-Erdős cardinal. Hans-Dieter Donder showed the reverse implication: if CC holds, then ω2 is ω1-Erdős in K. More generally, Chang's
József Solymosi (703 words) [view diff] exact match in snippet view article find links to article
that is linear in the number of points. This result is connected to the Erdős–Anning theorem, according to which an infinite set of points with integer
Centered cube number (349 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Steven Rudich (397 words) [view diff] exact match in snippet view article find links to article
of Cryptology,[citation needed] as well as an accomplished magician. His Erdős number is 2. Rudich (and Merrick Furst, now a Distinguished Professor at
Bertrand's postulate (2,001 words) [view diff] exact match in snippet view article find links to article
4n also goes to infinity, thereby generalizing Erdős' and Ramanujan's results (see the section on Erdős' theorems below). The first result is obtained
List coloring (1,585 words) [view diff] exact match in snippet view article find links to article
It was first studied in the 1970s in independent papers by Vizing and by Erdős, Rubin, and Taylor. Given a graph G and given a set L(v) of colors for each
Harmonic progression (mathematics) (638 words) [view diff] exact match in snippet view article
39: 17–24. As cited by Graham, Ronald L. (2013), "Paul Erdős and Egyptian fractions", Erdős centennial, Bolyai Soc. Math. Stud., 25, János Bolyai Math
Ernest S. Croot III (161 words) [view diff] exact match in snippet view article find links to article
Mathematics, Georgia Institute of Technology. He is known for his solution of the Erdős–Graham conjecture, and for contributing to the solution of the cap set problem
Odious number (243 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
György Elekes (557 words) [view diff] exact match in snippet view article find links to article
up a framework which eventually led Guth and Katz to the solution of the Erdős distinct distances problem. (See below.) After graduating from the mathematics
Sociable number (708 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Sparsely totient number (241 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Hungary at the 1976 Summer Olympics (590 words) [view diff] exact match in snippet view article find links to article
Jenő Kamuti, Sándor Erdős Men's épée Győző Kulcsár István Osztrics Csaba Fenyvesi Men's team épée Csaba Fenyvesi, Sándor Erdős, István Osztrics, Pál
Størmer number (365 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Super-Poulet number (259 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Lovász local lemma (1,980 words) [view diff] exact match in snippet view article find links to article
given below. A weaker version was proved in 1975 by László Lovász and Paul Erdős in the article Problems and results on 3-chromatic hypergraphs and some
Davenport–Erdős theorem (566 words) [view diff] exact match in snippet view article find links to article
In number theory, the Davenport–Erdős theorem states that, for sets of multiples of integers, several different notions of density are equivalent. Let
Dimension (graph theory) (1,032 words) [view diff] exact match in snippet view article
(see the figure to the right). This concept was introduced in 1965 by Paul Erdős, Frank Harary and William Tutte. It generalises the concept of unit distance
Girth (graph theory) (657 words) [view diff] exact match in snippet view article
produces triangle-free graphs of arbitrarily large chromatic number. Paul Erdős was the first to prove the general result, using the probabilistic method
Webgraph (430 words) [view diff] exact match in snippet view article find links to article
degree distribution of the classical random graph model, the Erdős–Rényi model: in the Erdős–Rényi model, there are very few large degree nodes, relative
Hilbert number (196 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Fifth power (algebra) (440 words) [view diff] exact match in snippet view article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Extremal graph theory (1,791 words) [view diff] exact match in snippet view article find links to article
subgraph of G {\displaystyle G} ? This question is mostly answered by the Erdős–Stone theorem. The main caveat is that for bipartite H {\displaystyle H}
Pseudoprime (349 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Renu C. Laskar (412 words) [view diff] exact match in snippet view article find links to article
number and circular arc graphs. She wrote four papers with Paul Erdős, giving her an Erdős number of 1. Renu C. Laskar was born in Bihar, India. With the
Author-level metrics (3,673 words) [view diff] exact match in snippet view article find links to article
It has been argued that "For an individual researcher, a measure such as Erdős number captures the structural properties of network whereas the h-index
Knödel number (125 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Centered pentagonal number (150 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Václav Chvátal (1,411 words) [view diff] exact match in snippet view article find links to article
connectivity and maximum independent set size of a graph, earned Chvátal his Erdős number of 1. Specifically, if there exists an s such that a given graph
Shiri Artstein (590 words) [view diff] exact match in snippet view article find links to article
born 28 September 1978) is an Israeli mathematician who in 2015 won the Erdős Prize. She specializes in convex geometry and asymptotic geometric analysis
G. W. Peck (298 words) [view diff] exact match in snippet view article find links to article
writers of this paper: Ronald Graham, Douglas West, George B. Purdy, Paul Erdős, Fan Chung, and Daniel Kleitman. The paper initially listed Peck's affiliation
Additive basis (610 words) [view diff] exact match in snippet view article find links to article
supremum.) The related Erdős–Fuchs theorem states that the number of representations cannot be close to a linear function. The Erdős–Tetali theorem states
Sylvester–Gallai theorem (5,121 words) [view diff] exact match in snippet view article find links to article
equivalent formulation, its projective dual. Unaware of Melchior's proof, Paul Erdős (1943) again stated the conjecture, which was subsequently proved by Tibor
Cosma Shalizi (234 words) [view diff] exact match in snippet view article find links to article
Department of Statistics at Carnegie Mellon University in Pittsburgh with an Erdős number of 3. Cosma Rohilla Shalizi is of Tamil, Afghan and Italian heritage
Irrationality sequence (619 words) [view diff] exact match in snippet view article find links to article
The problem of characterizing irrationality sequences was posed by Paul Erdős and Ernst G. Straus, who originally called the property of being an irrationality
Golomb ruler (1,450 words) [view diff] exact match in snippet view article find links to article
asymptotically optimal Golomb rulers. The following construction, due to Paul Erdős and Pál Turán, produces a Golomb ruler for every odd prime p. 2 p k + (
78 (number) (257 words) [view diff] exact match in snippet view article
bases greater 78. a Harshad number in bases 3, 4, 5, 6, 7, 13 and 14. an Erdős–Woods number, since it is possible to find sequences of 78 consecutive integers
Circle packing in an equilateral triangle (365 words) [view diff] exact match in snippet view article find links to article
circles, and conjectures are available for n < 28. A conjecture of Paul Erdős and Norman Oler states that, if n is a triangular number, then the optimal
George Piranian (321 words) [view diff] exact match in snippet view article find links to article
internationally known for his research in complex analysis, his association with Paul Erdős, and his editing of the Michigan Mathematical Journal. Piranian was born
76 (number) (294 words) [view diff] exact match in snippet view article
a 14-gonal number. a centered pentagonal number. a telephone number. an Erdős–Woods number since it is possible to find sequences of 76 consecutive integers
Ernst Specker (118 words) [view diff] exact match in snippet view article find links to article
the ordinal partition relation ω2 → (ω2,3)2, thereby solving a problem of Erdős. Specker received his Ph.D. in 1949 from ETH Zurich, where he remained throughout
The Housekeeper and the Professor (1,109 words) [view diff] exact match in snippet view article find links to article
Loved Only Numbers, a biography of the mathematician Paul Erdős. It has been said that Erdős was used as a model for the Professor. The novel received
Márton Erdős (76 words) [view diff] exact match in snippet view article find links to article
Márton Erdős (17 September 1944 – 25 November 2020) was a Hungarian wrestler. He competed in the men's freestyle 52 kg at the 1968 Summer Olympics. "Magyar
Wrestling at the 1968 Summer Olympics – Men's freestyle 52 kg (210 words) [view diff] exact match in snippet view article find links to article
Esenceli (TUR)  Paul Neff (FRG) 2.5 2.5 3 3  Florentino Martínez (MEX)  Márton Erdős (HUN) 1 1 0 0  Wanelge Castillo (PAN) TF / 8:15  Gustavo Ramírez (GUA) 4
Motzkin number (665 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Leonardo number (360 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of conjectures (641 words) [view diff] exact match in snippet view article find links to article
conjecture Von Neumann conjecture Weyl–Berry conjecture Williamson conjecture Erdős conjectures Fuglede's conjecture Millennium Prize Problems Painlevé conjecture
Smooth number (1,396 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Euclid number (503 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Sum-free set (288 words) [view diff] exact match in snippet view article find links to article
O ( 2 N / 2 ) {\displaystyle O(2^{N/2})} , as predicted by the Cameron–Erdős conjecture (see Sloane's OEIS: A007865). How many sum-free sets does an
Hungary at the 1972 Summer Olympics (1,208 words) [view diff] exact match in snippet view article find links to article
Light Flyweight Csaba Fenyvesi — Fencing, Men's Épée Individual Sándor Erdős, Csaba Fenyvesi, Győző Kulcsár, István Osztrics, and Pál Schmitt — Fencing
Digit sum (783 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Descartes number (510 words) [view diff] exact match in snippet view article find links to article
{\displaystyle 3} , then n has over a million distinct prime divisors. Erdős–Nicolas number, another type of almost-perfect number Currently, the only
Keith Briggs (mathematician) (229 words) [view diff] exact match in snippet view article
about him was in i-squared Magazine, Issue 6 (Winter 2008/9). Briggs has Erdős number equal to two, obtained by his joint authorship of two papers with
Aliquot sum (544 words) [view diff] exact match in snippet view article find links to article
al-Baghdadi (circa 1000 AD), who observed that both 2 and 5 are untouchable. Erdős proved that their number is infinite. The conjecture that 5 is the only
Weakly compact cardinal (647 words) [view diff] exact match in snippet view article find links to article
weakly compact cardinal is a certain kind of cardinal number introduced by Erdős & Tarski (1961); weakly compact cardinals are large cardinals, meaning that
Prime number theorem (7,201 words) [view diff] exact match in snippet view article find links to article
including the Erdős–Selberg priority dispute, see an article by Dorian Goldfeld. There is some debate about the significance of Erdős and Selberg's result
Wetzel's problem (527 words) [view diff] exact match in snippet view article find links to article
countable. Paul Erdős in turn learned about the problem at the University of Michigan, likely via Lee Albert Rubel. In his paper on the problem, Erdős credited
Property B (1,101 words) [view diff] exact match in snippet view article find links to article
1016/0012-365X(78)90191-7, MR 0522920 Erdős, Paul (1963), "On a combinatorial problem", Nordisk Mat. Tidskr., 11: 5–10 Erdős, P. (1964). "On a combinatorial
Eighth power (579 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Idoneal number (477 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Eureka (University of Cambridge magazine) (276 words) [view diff] exact match in snippet view article
authors include many famous mathematicians and scientists such as Paul Erdős, Martin Gardner, Douglas Hofstadter, G. H. Hardy, Béla Bollobás, John Conway
Peter G. Harrison (359 words) [view diff] exact match in snippet view article find links to article
The Computer Journal. Via Saharon Shelah and Dov Gabbay, Harrison has an Erdős number of 3. Harrison, Peter G. (1986). "An Enhanced Approximation by Pair-Wise
Refactorable number (541 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Orchard-planting problem (626 words) [view diff] exact match in snippet view article find links to article
investigations into how many k-point lines there can be. Hallard T. Croft and Paul Erdős proved tk > c n2 / k3, where n is the number of points and tk is the number
Leon Bankoff (397 words) [view diff] exact match in snippet view article find links to article
as a co-author. Bankoff collaborated with Paul Erdős in a mathematics paper and therefore has an Erdős number 1. From 1968 to 1981, Bankoff was the editor
Back-and-forth method (629 words) [view diff] exact match in snippet view article find links to article
two equivalent countable atomic models of a theory are isomorphic. the Erdős–Rényi model of random graphs, when applied to countably infinite graphs
Jean-Louis Nicolas (317 words) [view diff] exact match in snippet view article find links to article
theorist. He is the namesake (with Paul Erdős) of the Erdős–Nicolas numbers, and was a frequent co-author of Erdős, who would take over the desk of Nicolas'
Giant component (1,565 words) [view diff] exact match in snippet view article find links to article
entire graph's vertices. Giant components are a prominent feature of the Erdős–Rényi model (ER) of random graphs, in which each possible edge connecting
Stella octangula number (466 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Strictly non-palindromic number (528 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Random geometric graph (2,556 words) [view diff] exact match in snippet view article find links to article
Other random graph generation algorithms, such as those generated using the Erdős–Rényi model or Barabási–Albert (BA) model do not create this type of structure
Gelation (970 words) [view diff] exact match in snippet view article find links to article
branch units. Gelation of polymers can be described in the framework of the Erdős–Rényi model or the Lushnikov model, which answers the question when a giant
Equitable coloring (2,286 words) [view diff] exact match in snippet view article find links to article
equal to k. The Hajnal–Szemerédi theorem, posed as a conjecture by Paul Erdős (1964) and proven by András Hajnal and Endre Szemerédi (1970), states that
Centered hexagonal number (393 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Giuga number (751 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Johan Håstad (393 words) [view diff] exact match in snippet view article find links to article
the International Congress of Mathematicians in Berlin. In 1999 he was an Erdős Lecturer at the Hebrew University of Jerusalem. In 2012, he became a fellow
Covering system (1,207 words) [view diff] exact match in snippet view article find links to article
contains every integer. The notion of covering system was introduced by Paul Erdős in the early 1930s. The following are examples of covering systems: { 0
Carol number (406 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Dodecagonal number (184 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Undulating number (346 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Engel expansion (1,871 words) [view diff] exact match in snippet view article find links to article
On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Erdős, Rényi & Szüsz (1958); Erdős & Shallit (1991). Wu (2000). Wu credits the result that the
Leyland number (538 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Chen Chung Chang (187 words) [view diff] exact match in snippet view article find links to article
the arrow notation for Ramsey theory) ωω→(ωω,3)2, originally a problem of Erdős and Hajnal. He also introduced MV-algebras as models for Łukasiewicz logic
Katalin Vesztergombi (390 words) [view diff] exact match in snippet view article find links to article
and discrete geometry. A student of Vera T. Sós and a co-author of Paul Erdős, she is an emeritus associate professor at Eötvös Loránd University and
Kemnitz's conjecture (310 words) [view diff] exact match in snippet view article find links to article
conjecture was formulated in 1983 by Arnfried Kemnitz as a generalization of the Erdős–Ginzburg–Ziv theorem, an analogous one-dimensional result stating that every
Steven Gaal (497 words) [view diff] exact match in snippet view article find links to article
Paul Erdős wrote to Pál Turán, in which he mentions a prize problem posed by the Netherlands Mathematical Society. Gaal solved it and with Erdős jointly
Meertens number (474 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Spectral graph theory (1,473 words) [view diff] exact match in snippet view article find links to article
This bound has been applied to establish e.g. algebraic proofs of the Erdős–Ko–Rado theorem and its analogue for intersecting families of subspaces
Centered nonagonal number (275 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Sum-free sequence (656 words) [view diff] exact match in snippet view article find links to article
instance, by the prime number theorem, the prime numbers are not small. Paul Erdős (1962) proved that every sum-free sequence is small, and asked how large
Scale-free network (6,837 words) [view diff] exact match in snippet view article find links to article
are different from random Erdős–Rényi networks.^[16a] Thus, scale free networks are in a different universality class from Erdős–Rényi networks. Another
Decagonal number (219 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Kynea number (351 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Prime power (520 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Outline of combinatorics (680 words) [view diff] exact match in snippet view article find links to article
Winning Ways for your Mathematical Plays Persi Diaconis Ada Dietz Paul Erdős Erdős conjecture Philippe Flajolet Solomon Golomb Ron Graham Ben Green Tim
Seventh power (565 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Weird number (666 words) [view diff] exact match in snippet view article find links to article
Springer-Verlag. pp. 113–114. ISBN 1-4020-4215-9. Zbl 1151.11300. Benkoski, Stan; Erdős, Paul (April 1974). "On Weird and Pseudoperfect Numbers". Mathematics of
Lucky number (739 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Centered polygonal number (778 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Gyula O. H. Katona (282 words) [view diff] exact match in snippet view article find links to article
for the Kruskal–Katona theorem and his beautiful and elegant proof of the Erdős–Ko–Rado theorem in which he discovered a new method, now called Katona's
Octagonal number (305 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Practical number (3,103 words) [view diff] exact match in snippet view article find links to article
resembles the prime number theorem, strengthening the earlier claim of Erdős & Loxton (1979) that the practical numbers have density zero in the integers
Nikolay Konstantinov (485 words) [view diff] exact match in snippet view article find links to article
organizer of the Tournament of the Towns. For his work he was awarded the Paul Erdős award in 1992. Konstantinov was born and grew up in Moscow, Soviet Union
Forbidden subgraph problem (2,380 words) [view diff] exact match in snippet view article find links to article
turns out to be correct, up to o ( n 2 ) {\displaystyle o(n^{2})} error. 'Erdős–Stone theorem'. For all positive integers n {\displaystyle n} and all graphs
Fourth power (692 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Centered decagonal number (202 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Abraham Ziv (270 words) [view diff] exact match in snippet view article find links to article
contributions to the Zero-sum problem as one of the discoverers of the Erdős–Ginzburg–Ziv theorem. Abraham Zubkowski (later Ziv) was born in Avihayil
Opsimath (231 words) [view diff] exact match in snippet view article find links to article
fictitious character Sir Henry Rawlinson, Grandma Moses, mathematician Paul Erdős (who published papers until his death at age 83), Rabbi Akiva (according
Proceedings of A. Razmadze Mathematical Institute (136 words) [view diff] exact match in snippet view article find links to article
Zentralblatt für Mathematik and Mathematical Reviews. Notable authors include Paul Erdős, Edmund Landau, and Hua Luogeng. The current editor in chief is Vakhtang
X-Faktor (series 7) (454 words) [view diff] exact match in snippet view article
Judge's vote to eliminate ByeAlex: Lívia Abaházi Nagy Radics: Viola Erdős Puskás: Viola Erdős Gáspár: Lívia Abaházi Nagy With each act receiving two votes,
Reciprocal Fibonacci constant (301 words) [view diff] exact match in snippet view article find links to article
digits. ψ is known to be irrational; this property was conjectured by Paul Erdős, Ronald Graham, and Leonard Carlitz, and proved in 1989 by Richard André-Jeannin
Star number (303 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Bruce Lee Rothschild (196 words) [view diff] exact match in snippet view article find links to article
related to Ramsey theory. Rothschild wrote several papers with Paul Erdős, giving him an Erdős number of 1. In 1971, Rothschild shared the Pólya Prize (SIAM)
Sixth power (760 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Péter Frankl (625 words) [view diff] exact match in snippet view article find links to article
International Mathematical Olympiad in 1971. He has seven joint papers with Paul Erdős, and eleven joint papers with Ronald Graham. His research is in combinatorics
Ran Raz (461 words) [view diff] exact match in snippet view article find links to article
Safra (1997) on probabilistically checkable proofs. Ran Raz received the Erdős Prize in 2002. His work has been awarded in the top conferences in theoretical
The Martians (scientists) (939 words) [view diff] exact match in snippet view article
account is featured in György Marx's book The Voice of the Martians. Paul Erdős, Paul Halmos, Theodore von Kármán, John G. Kemeny, John von Neumann, George
Strobogrammatic number (758 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Jerzy Jurka (509 words) [view diff] exact match in snippet view article find links to article
George Irving Bell, Roy Britten, Temple Smith, and Emile Zuckerkandl. His Erdős number is 3, using the path through Temple Smith and Stanislaw Ulam. Dr
Persistence of a number (604 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Arithmetic combinatorics (839 words) [view diff] exact match in snippet view article find links to article
concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural
94 (number) (599 words) [view diff] exact match in snippet view article
distinct semiprimes, 93, 94 and 95. a 17-gonal number and a nontotient. an Erdős–Woods number, since it is possible to find sequences of 94 consecutive integers
Ramsey cardinal (418 words) [view diff] exact match in snippet view article find links to article
Ramsey cardinal is a certain kind of large cardinal number introduced by Erdős & Hajnal (1962) and named after Frank P. Ramsey, whose theorem establishes
Proceedings of A. Razmadze Mathematical Institute (136 words) [view diff] exact match in snippet view article find links to article
Zentralblatt für Mathematik and Mathematical Reviews. Notable authors include Paul Erdős, Edmund Landau, and Hua Luogeng. The current editor in chief is Vakhtang
Richard Schroeppel (454 words) [view diff] exact match in snippet view article find links to article
Sieves," Notices of the AMS, Vol. 43, No. 12, December 1996.) Schroeppel's Erdős number is 2. HAKMEM Counter machine "Lane Student Wins Top U.S. Math Award""Chicago
Lucky numbers of Euler (301 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Jacobsthal number (608 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
D. H. Lehmer (1,282 words) [view diff] exact match in snippet view article find links to article
that Erdős and Lehmer taught a course together on Research Problems in the Theory of Numbers. Lehmer taught the first eight weeks and then Erdős taught
Hugh David Politzer (631 words) [view diff] exact match in snippet view article find links to article
which put out their single, "The Simple Harmonic Oscillator". Politzer's Erdős-Bacon number is 5 – via appearing in Fat Man and Little Boy with Laura Dern
Ran Raz (461 words) [view diff] exact match in snippet view article find links to article
Safra (1997) on probabilistically checkable proofs. Ran Raz received the Erdős Prize in 2002. His work has been awarded in the top conferences in theoretical
Convex position (409 words) [view diff] exact match in snippet view article find links to article
polynomial time by dynamic programming for points in convex position. The Erdős–Szekeres theorem guarantees that every set of n points in general position
Mathukumalli V. Subbarao (573 words) [view diff] exact match in snippet view article find links to article
collaborator, Subbarao had more than 40 joint authors (including Paul Erdős, giving him Erdős number 1). He continued producing mathematics papers into the final
Leonidas Alaoglu (545 words) [view diff] exact match in snippet view article find links to article
Lecture Series was established at Caltech. Speakers have included Paul Erdős, Irving Kaplansky, Paul Halmos and Hugh Woodin. Axiom of Choice – The Banach–Alaoglu
Fortunate number (294 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Kruskal–Katona theorem (951 words) [view diff] exact match in snippet view article find links to article
f-vectors of abstract simplicial complexes. It includes as a special case the Erdős–Ko–Rado theorem and can be restated in terms of uniform hypergraphs. It
G. H. Hardy (2,813 words) [view diff] exact match in snippet view article find links to article
Hardy and Ramanujan became close collaborators. In an interview by Paul Erdős, when Hardy was asked what his greatest contribution to mathematics was
Centered octahedral number (692 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Barycentric-sum problem (909 words) [view diff] exact match in snippet view article find links to article
which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include
Mathukumalli Vidyasagar (446 words) [view diff] exact match in snippet view article find links to article
is the son of eminent mathematician M V Subbarao.[citation needed] His Erdős number is two and his Einstein number is three. Vidyasagar received several
Lucas–Carmichael number (221 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
92 (number) (521 words) [view diff] exact match in snippet view article
palindromic in bases 6 (2326), 7 (1617), 22 (4422), and 45 (2245). an Erdős–Woods number, since it is possible to find sequences of 92 consecutive integers
Einstein Institute of Mathematics (645 words) [view diff] exact match in snippet view article find links to article
(1949– ) Eliyahu Rips (1948– ); Erdős Prize (1979) Zlil Sela (1962– ) Aner Shalev (1958– ) Saharon Shelah (1945– ); Erdős Prize (1977), Pólya Prize (1992)
List of Jewish mathematicians (15,629 words) [view diff] exact match in snippet view article find links to article
mathematician Semyon Alesker (born 1972), convex and integral geometry; Erdős Prize (2004) Al-Samawal al-Maghribi (c. 1130–c. 1180), mathematician, astronomer
Vampire number (812 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Almost prime (415 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Irit Dinur (373 words) [view diff] exact match in snippet view article find links to article
International Congress of Mathematicians. In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union. She was the
Centered triangular number (319 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Leonid Polterovich (161 words) [view diff] exact match in snippet view article find links to article
University in 1990. In 1996, he was awarded the EMS Prize, and in 1998 the Erdős Prize. In 1998 he was an Invited Speaker of the International Congress of
List of mathematical probabilists (520 words) [view diff] exact match in snippet view article find links to article
(1920–2010) Eugene Dynkin (1924–2014) Robert J. Elliott (born 1940) Paul Erdős (1913–1996) Alison Etheridge (born 1964) Steve Evans (born 1960) William
70 (number) (1,065 words) [view diff] exact match in snippet view article
(2234). a Harshad number in bases 6, 8, 9, 10, 11, 13, 14, 15 and 16. an Erdős–Woods number, since it is possible to find sequences of 70 consecutive integers
Steven J. Ostro (1,043 words) [view diff] no match in snippet view article find links to article
Steven Jeffrey Ostro (March 9, 1946 – December 15, 2008) was an American scientist specializing in radar astronomy. He worked at NASA's Jet Propulsion
86 (number) (441 words) [view diff] exact match in snippet view article
noncototient. the 25th distinct semiprime and the 13th of the form (2.q). an Erdős–Woods number, since it is possible to find sequences of 86 consecutive integers
46 (number) (704 words) [view diff] exact match in snippet view article
member shares a factor with either the first or the last member, 46 is an Erdős–Woods number. The atomic number of palladium. The number of human chromosomes
Coupon collector's problem (1,536 words) [view diff] exact match in snippet view article find links to article
n}]\leq n^{-\beta +1}\end{aligned}}} Pierre-Simon Laplace, but also Paul Erdős and Alfréd Rényi, proved the limit theorem for the distribution of T. This
Friendship graph (721 words) [view diff] exact match in snippet view article find links to article
F2 is isomorphic to the butterfly graph. The friendship theorem of Paul Erdős, Alfréd Rényi, and Vera T. Sós (1966) states that the finite graphs with
E. T. Parker (304 words) [view diff] exact match in snippet view article find links to article
Ph.D. student, K. B. Reid, disproved a conjecture on tournaments by Paul Erdős and Leo Moser. Parker received his Ph.D. for work 'On Quadruply Transitive
Critical exponent (2,289 words) [view diff] exact match in snippet view article find links to article
Mean field critical exponents are also valid for random graphs, such as Erdős–Rényi graphs, which can be regarded as infinite dimensional systems. The
Octahedral number (904 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
64 (number) (792 words) [view diff] exact match in snippet view article
member shares a factor with either the first or the last member, 64 is an Erdős–Woods number. In base 10, no integer added up to its own digits yields 64
David Conlon (312 words) [view diff] exact match in snippet view article find links to article
In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers. He won the European Prize in
96 (number) (617 words) [view diff] exact match in snippet view article
11 (8811), 15 (6615), 23 (4423), 31 (3331), 47 (2247) and 95 (1195) an Erdős–Woods number, since it is possible to find sequences of 96 consecutive integers
Self-descriptive number (801 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Henry Cohn (189 words) [view diff] exact match in snippet view article find links to article
Harvard University in 2000 with a doctorate in mathematics. Cohn was an Erdős Lecturer at Hebrew University of Jerusalem in 2008. In 2016, he became a
Digit-reassembly number (940 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Nonhypotenuse number (451 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Robert Morris (mathematician) (178 words) [view diff] exact match in snippet view article
number theory and combinatorics, such as the solution of old problem of Erdős and for establishing tight bounds for Ramsey numbers, and also on random
Double acute accent (754 words) [view diff] exact match in snippet view article find links to article
(mnemonic for "Hungarian") command. For example, the name Paul Erdős (in his native Hungarian: Erdős Pál) would be typeset as Erd\H{o}s P\'al. In modern X11
96 (number) (617 words) [view diff] exact match in snippet view article
11 (8811), 15 (6615), 23 (4423), 31 (3331), 47 (2247) and 95 (1195) an Erdős–Woods number, since it is possible to find sequences of 96 consecutive integers
K. B. Reid (179 words) [view diff] exact match in snippet view article find links to article
known (with E. T. Parker) on a disproof of a conjecture on tournaments by Erdős and Moser He received his Ph.D. on a dissertation called "Structure in Finite
Gérald Tenenbaum (590 words) [view diff] exact match in snippet view article find links to article
novelist, born in Nancy on 1 April 1952. He is one of the namesakes of the Erdős–Tenenbaum–Ford constant. An alumnus of the École Polytechnique, he has been
Digit-reassembly number (940 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Minimum overlap problem (408 words) [view diff] exact match in snippet view article find links to article
minimum overlap problem is a problem proposed by Hungarian mathematician Paul Erdős in 1955. Let A = {ai} and B = {bj} be two complementary subsets, a splitting
Elon Lindenstrauss (539 words) [view diff] exact match in snippet view article find links to article
received the Michael Bruno Memorial Award. In 2009, he was awarded the Erdős Prize. In 2009, he received the Fermat Prize. In 2010, he became the first
56 (number) (1,065 words) [view diff] exact match in snippet view article
of distinct ways 11 can be represented as the sum of natural numbers. An Erdős–Woods number, since it is possible to find sequences of 56 consecutive integers
David Conlon (312 words) [view diff] exact match in snippet view article find links to article
In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers. He won the European Prize in
Jurjen Ferdinand Koksma (225 words) [view diff] exact match in snippet view article find links to article
published in 1936 by Springer. He also wrote several papers with Paul Erdős. In 1950 he became member of the Royal Netherlands Academy of Arts and Sciences
Andrew Odlyzko (632 words) [view diff] exact match in snippet view article find links to article
function and random matrix theory. As a direct collaborator of Paul Erdős, he has Erdős number 1. More recently, he has worked on communication networks
Distance set (769 words) [view diff] exact match in snippet view article find links to article
Although partial results are known, the conjecture remains unproven. The Erdős–Ulam problem asks whether it is possible to have a dense set in the Euclidean
László Lovász (1,133 words) [view diff] exact match in snippet view article find links to article
When he was fourteen years old, Lovász came across an article by Paul Erdős in the Mathematical and Physical Journal for Secondary Schools (1962) and
Centered square number (575 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Wheel graph (586 words) [view diff] exact match in snippet view article find links to article
independent. The wheel W6 supplied a counterexample to a conjecture of Paul Erdős on Ramsey theory: he had conjectured that the complete graph has the smallest
Jónsson function (346 words) [view diff] exact match in snippet view article find links to article
with a given order type. Jónsson functions are named for Bjarni Jónsson. Erdős and Hajnal (1966) showed that for every ordinal λ there is an ω-Jónsson
Polydivisible number (1,829 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Bálint Tóth (144 words) [view diff] exact match in snippet view article find links to article
(since 1997 the prize is called 'Paul Erdõs Prize' after the late Paul Erdős). From 2005 to 2009 Bálint Tόth was the director of the Institute of Mathematics
Discrete geometry (1,563 words) [view diff] exact match in snippet view article find links to article
Tait, Heawood, and Hadwiger. László Fejes Tóth, H.S.M. Coxeter and Paul Erdős, laid the foundations of discrete geometry. A polytope is a geometric object
Thrackle (1,296 words) [view diff] exact match in snippet view article find links to article
at most as many edges as vertices, a fact that was observed by Paul Erdős. Erdős observed that, if a vertex v is connected to three or more edges vw,
Highly cototient number (410 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Perfect totient number (645 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
88 (number) (1,435 words) [view diff] exact match in snippet view article
primitive semiperfect number. an untouchable number. a hexadecagonal number. an Erdős–Woods number, since it is possible to find sequences of 88 consecutive integers
Prime gap (3,147 words) [view diff] exact match in snippet view article find links to article
infinitely many values n, improving the results of Westzynthius and Paul Erdős. He later showed that one can take any constant c < eγ, where γ is the Euler–Mascheroni
Semyon Alesker (68 words) [view diff] exact match in snippet view article find links to article
particular his work on valuations, he won the EMS Prize in 2000, and the Erdős Prize in 2004. Casacuberta, Carlos (2001). European Congress of Mathematics:
Norman H. Anning (639 words) [view diff] exact match in snippet view article find links to article
sets of points in the plane with mutually integer distances, known as the Erdős–Anning theorem. Anning was originally from Holland Township (currently Chatsworth)
Low-discrepancy sequence (3,848 words) [view diff] exact match in snippet view article find links to article
hard to find the exact value of the discrepancy of large point sets. The Erdős–Turán–Koksma inequality provides an upper bound. Let x1,...,xN be points
Singmaster's conjecture (1,277 words) [view diff] exact match in snippet view article find links to article
showed that N ( a ) = O ( log ⁡ a ) . {\displaystyle N(a)=O(\log a).} Abbot, Erdős, and Hanson (1974) (see References) refined the estimate to: N ( a ) = O
László Rátz (3,191 words) [view diff] exact match in snippet view article find links to article
Economics. He died in Berkeley, California, USA. Pál Erdős (Paul Erdős) (1913–1996) (Hungarian: Erdős Pál), was born in Budapest, he became a mathematician
66 (number) (626 words) [view diff] exact match in snippet view article
number. a semiperfect number, being a multiple of a perfect number. an Erdős–Woods number, since it is possible to find sequences of 66 consecutive integers
Patricia Fauring (95 words) [view diff] exact match in snippet view article find links to article
Ana María Patricia Fauring is an Argentine mathematician who won the Paul Erdős Award for being "the principal mathematician involved in training Argentine
Nonagonal number (346 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Chris Godsil (256 words) [view diff] exact match in snippet view article find links to article
supervision of Derek Alan Holton. He wrote a paper with Paul Erdős, so making his Erdős number equal to 1. Robin J. Wilson's review of Godsil & Royle
Ergodic Ramsey theory (250 words) [view diff] exact match in snippet view article find links to article
concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural
Gábor Tardos (583 words) [view diff] exact match in snippet view article find links to article
Hungarian Academy of Sciences for Young Researchers. In 1999 he received the Erdős Prize from the Hungarian Academy of Sciences and the Rényi Prize of the
Multiply perfect number (1,051 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Multiplicative digital root (886 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Saharon Shelah (1,322 words) [view diff] exact match in snippet view article find links to article
Mathematicians (1974 invited, 1983 plenary, 1986 plenary) The first recipient of the Erdős Prize, in 1977; The Karp Prize of the Association for Symbolic Logic in
Keith number (952 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Vitaly Bergelson (319 words) [view diff] exact match in snippet view article find links to article
Szemerédi's theorem. The latter provided a positive solution to the famous Erdős–Turán conjecture from 1936 stating that any set of integers of positive
Budapest Semesters in Mathematics (484 words) [view diff] exact match in snippet view article find links to article
Sciences. Originally started by László Lovász, László Babai, Vera Sós, and Pál Erdős, the first semester was conducted in Spring 1985. The North- American part
John Selfridge (1,622 words) [view diff] exact match in snippet view article find links to article
they also all participated in the Cunningham project. Together with Paul Erdős, Selfridge solved a 150-year-old problem, proving that the product of consecutive
Robin Wilson (mathematician) (1,054 words) [view diff] exact match in snippet view article
collaboration on a 1977 paper with the Hungarian mathematician Paul Erdős, Wilson has an Erdős number of 1. In July 2008, he published a study of the mathematical
Unit fraction (1,051 words) [view diff] exact match in snippet view article find links to article
seen interest in modern number theory; for instance, the Erdős–Graham conjecture and the Erdős–Straus conjecture concern sums of unit fractions, as does
Node deletion (766 words) [view diff] exact match in snippet view article find links to article
most connected one (the node with the highest degree) the diameter of the Erdős-Rényi model reacts similarly to a random deletion of nodes. This is because
Figurate number (1,145 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Intersection graph (1,090 words) [view diff] exact match in snippet view article find links to article
nonempty intersection if and only if the corresponding vertices share an edge. Erdős, Goodman & Pósa (1966) provide a construction that is more efficient (which
Svante Janson (1,157 words) [view diff] exact match in snippet view article find links to article
four books and over 300 academic papers (as of 2017[update]). He has an Erdős number of 1. Svante Janson has already had a long career in mathematics
Ban number (400 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Longest increasing subsequence (1,708 words) [view diff] exact match in snippet view article find links to article
algorithm up to the constant factor in the O(n) term. According to the Erdős–Szekeres theorem, any sequence of n2+1 distinct integers has an increasing
Saharon Shelah (1,322 words) [view diff] exact match in snippet view article find links to article
Mathematicians (1974 invited, 1983 plenary, 1986 plenary) The first recipient of the Erdős Prize, in 1977; The Karp Prize of the Association for Symbolic Logic in
Lobb number (375 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Svante Janson (1,157 words) [view diff] exact match in snippet view article find links to article
four books and over 300 academic papers (as of 2017[update]). He has an Erdős number of 1. Svante Janson has already had a long career in mathematics
Graph coloring (6,848 words) [view diff] exact match in snippet view article find links to article
assumption of the axiom of choice. This is the de Bruijn–Erdős theorem of de Bruijn & Erdős (1951). If a graph admits a full n-coloring for every n ≥
Cullen number (822 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Fencing at the 1972 Summer Olympics – Men's team épée (105 words) [view diff] exact match in snippet view article find links to article
Csaba Fenyvesi, Győző Kulcsár, Pál Schmitt, Sándor Erdős, István Osztrics  Hungary Guy Evéquoz, Peter Lötscher, Daniel Giger, Christian Kauter, François
Ban number (400 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Perfect digit-to-digit invariant (1,096 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Double Mersenne number (958 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Narayana number (1,139 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
2017–18 Szombathelyi Haladás season (380 words) [view diff] exact match in snippet view article find links to article
Szombathelyi Haladás Budapest, Pest County 20:30 CEST Bobál D.  30' Lanzafame  89' (Report) Stadium: Bozsik Stadion Attendance: 2,090 Referee: József Erdős
Dima Grigoriev (319 words) [view diff] exact match in snippet view article find links to article
International Congress of Mathematicians, Berkeley, California, 1986. He has Erdős number 2 due to his collaborations with Andrew Odlyzko. Anatol Slissenko's
Zeisel number (397 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Factorion (1,392 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Additive combinatorics (786 words) [view diff] exact match in snippet view article find links to article
considered to be direct problems as well. Examples of this type include the Erdős–Heilbronn Conjecture (for a restricted sumset) and the Cauchy–Davenport
Highly totient number (381 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Primeval number (368 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Graphon (4,205 words) [view diff] exact match in snippet view article find links to article
generalization of the Erdős–Rényi model. We can interpret this as a random graph model consisting of k {\displaystyle k} distinct Erdős–Rényi graphs with
Harshad number (2,186 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Chvátal graph (726 words) [view diff] exact match in snippet view article find links to article
cycles and cliques) has chromatic number at most k. It was also known since Erdős (1959) that, for every k and l there exist k-chromatic graphs with girth
Lucas number (1,410 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
36 (number) (1,082 words) [view diff] exact match in snippet view article
member shares a factor with either the first or the last member, 36 is an Erdős–Woods number. The sum of the integers from 1 to 36 is 666 (see number of
Tom Duff (702 words) [view diff] exact match in snippet view article find links to article
programming language trick attributed to Tom Duff List of people by Erdős number — Duff has an Erdős number of 2 List of Pixar staff Porter, Thomas; Tom Duff (1984)
Adi Shamir (776 words) [view diff] exact match in snippet view article find links to article
contributions to cryptography the Paris Kanellakis Theory and Practice Award; the Erdős Prize of the Israel Mathematical Society, the 1986 IEEE W.R.G. Baker Award
Sum-product number (994 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Danica McKellar (2,424 words) [view diff] exact match in snippet view article find links to article
work on research papers, McKellar is currently assigned the Erdős number four, and her Erdős–Bacon number is six. At age seven, McKellar enrolled in weekend
Turán's theorem (1,592 words) [view diff] exact match in snippet view article find links to article
{\displaystyle (n-r)} -vertex subgraph gives the result. A different proof by Paul Erdős finds the maximum-degree vertex v {\displaystyle v} from a K r + 1 {\displaystyle
Littlewood–Offord problem (397 words) [view diff] exact match in snippet view article find links to article
2^{n}} of the 2n possible subsums of S fall into the disc. In 1945 Paul Erdős improved the upper bound for d = 1 to ( n ⌊ n / 2 ⌋ ) ≈ 2 n 1 n {\displaystyle
Sunflower (mathematics) (804 words) [view diff] exact match in snippet view article
S} , may be empty; a collection of disjoint subsets is also a sunflower. Erdős & Rado (1960, p. 86) proved the sunflower lemma, stating that if a {\displaystyle
1937 European Figure Skating Championships (112 words) [view diff] exact match in snippet view article find links to article
Kingdom 7 Věra Hrubá  Czechoslovakia 8 Eva Nyklova  Czechoslovakia 9 Klára Erdős  Hungary 10 Martha Mayerhans  Germany 11 Audrey Peppe  Austria 12 Joy Ricketts
Strong pseudoprime (1,332 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
The Book (178 words) [view diff] exact match in snippet view article find links to article
(Arabic: القرآن al-qur'ān, literally "the recitation") The telephone book Paul Erdős' concept of "The Book", in which God maintains the most elegant proofs of
Andries Brouwer (595 words) [view diff] exact match in snippet view article find links to article
His co-authors include at least 9 of the co-authors of Paul Erdős, giving him an Erdős number of 2. In December 1984, while at the Centrum Wiskunde &
Wooded Carpathians (379 words) [view diff] exact match in snippet view article find links to article
Carpathians (Ukrainian: Лісисті Карпати; Polish: Karpaty Lesiste; Hungarian: Erdős-Kárpátok; German: Waldkarpaten) refers to a group of mountain ranges that
Hierarchical network model (1,185 words) [view diff] exact match in snippet view article find links to article
replication factor of the model. In contrast to the other scale-free models (Erdős–Rényi, Barabási–Albert, Watts–Strogatz) where the clustering coefficient
Ságvár (117 words) [view diff] exact match in snippet view article find links to article
first owner. The word ság meant in old Hungarian domb (English: hill) or erdős magaslat (English: wooded heights). Vár (English: castle) refers to the
Even circuit theorem (724 words) [view diff] exact match in snippet view article find links to article
In extremal graph theory, the even circuit theorem is a result of Paul Erdős according to which an n-vertex graph that does not have a simple cycle of
Parasitic number (1,022 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Complex network (3,192 words) [view diff] exact match in snippet view article find links to article
(roughly) the same degree. Examples of networks with a single scale include the Erdős–Rényi (ER) random graph, random regular graphs, regular lattices, and hypercubes
Dudeney number (769 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Handball at the 1996 Summer Olympics (53 words) [view diff] exact match in snippet view article find links to article
Moon Hyang-Ja Oh Sung-Ok Oh Yong-Ran Park Jeong-Lim  Hungary (HUN) Éva Erdős Andrea Farkas Beáta Hoffmann Anikó Kántor Erzsébet Kocsis Beatrix Kökény
Narcissistic number (1,156 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Delannoy number (1,170 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Louis J. Mordell (666 words) [view diff] exact match in snippet view article find links to article
the continent of Europe. He brought in Reinhold Baer, G. Billing, Paul Erdős, Chao Ko, Kurt Mahler, and Beniamino Segre. He also recruited J. A. Todd
Kaisa Matomäki (664 words) [view diff] exact match in snippet view article find links to article
results, in turn, were among the tools used by Terence Tao to prove the Erdős discrepancy problem. Kaisa Matomäki, along with Maksym Radziwill of McGill
Woodall number (835 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
János Pach (1,239 words) [view diff] exact match in snippet view article find links to article
of the most frequent collaborators of Paul Erdős, authoring over 20 papers with him and thus has an Erdős number of one. Pach's research is focused in
Kiralee Hayashi (420 words) [view diff] exact match in snippet view article find links to article
(LONI). She co-authored several papers on neuroscience topics. She has a low Erdős number of just three through the publication Brain surface parameterization
Perrin number (1,595 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Pósa's theorem (317 words) [view diff] exact match in snippet view article find links to article
of low-degree vertices. It is named after Lajos Pósa, a protégé of Paul Erdős born in 1947, who discovered this theorem in 1962. The Pósa condition for
Self number (1,265 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Hexagonal number (696 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Hungary at the 1906 Intercalated Games (46 words) [view diff] exact match in snippet view article find links to article
82 21 Frigyes Gráf 82 21 Árpád Erdős 75 29 Kálmán Szabó 74 31 Gyula Kakas 74 31 Vilmos Szűcs 71 35 Béla Dáner Árpád Erdős Béla Erődi Frigyes Gráf Gyula
Polygonal number (1,012 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Ulam number (1,520 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Gábor N. Sárközy (235 words) [view diff] exact match in snippet view article find links to article
editorial board of the European Journal of Combinatorics. He also has an Erdős number of 1. Gabor Sarkozy's Renyi Homepage The Mathematics Genealogy Project
Kevin Ford (mathematician) (490 words) [view diff] exact match in snippet view article
collaboration with Green, Konyagin and Tao, . resolved a longstanding conjecture of Erdős on large gaps between primes, also proven independently by James Maynard
Regular number (2,468 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Ibolya Oláh (416 words) [view diff] exact match in snippet view article find links to article
originals as well as poetry made into songs. These poems were written by Virág Erdős, Péter Kántor, Lajos Parti Nagy, Zorán Sztevanovity, Dániel Varró, Péter
Esther Szekeres (344 words) [view diff] exact match in snippet view article find links to article
in Budapest, Klein was a member of a group of Hungarians including Paul Erdős, George Szekeres and Pál Turán that convened over interesting mathematical
Tim Foecke (1,517 words) [view diff] exact match in snippet view article find links to article
Kevin Bacon), and an Erdős number of 4 (via Robb Thomson to Peter Bergmann To Ernst G. Straus to Paul Erdős), giving him an Erdős–Bacon number of 6. US
Tom Brown (mathematician) (1,203 words) [view diff] exact match in snippet view article
Brown’s most notable collaborations was with notable Ramsey Theorist, Paul Erdős. He has noted that “talking with Erdӧs, or just overhearing him talking
Barrow's inequality (541 words) [view diff] exact match in snippet view article find links to article
\left({\tfrac {\pi }{3}}\right)=2} . Barrow's inequality strengthens the Erdős–Mordell inequality, which has identical form except with PU, PV, and PW
Ginsiella (19 words) [view diff] exact match in snippet view article find links to article
Ginsiella Erdős, 1951 Type species Ginsiella triarticulata Erdős, 1951 Species Ginsiella indica Arifa & Khan, 1992 Ginsiella triarticulata Erdős, 1951
Equilateral triangle (3,050 words) [view diff] exact match in snippet view article find links to article
triangle is there a point for which this ratio is as small as 2. This is the Erdős–Mordell inequality; a stronger variant of it is Barrow's inequality, which
No-three-in-line problem (1,393 words) [view diff] exact match in snippet view article find links to article
arbitrarily large values of n place slightly fewer than 3n/2 points. Paul Erdős (in Roth 1951) observed that, when n is a prime number, the set of n grid
Ágnes Szendrei (218 words) [view diff] exact match in snippet view article find links to article
Golden Ring of the Republic in 1979. She was the 1992 winner of the Paul Erdős Prize of the Hungarian Academy of Sciences, and the 2000 winner of the Academy's
Gaussian moat (445 words) [view diff] exact match in snippet view article find links to article
Basil Gordon (although it has sometimes been erroneously attributed to Paul Erdős) and it remains unsolved. With the usual prime numbers, such a sequence
Richard Erdoes (1,047 words) [view diff] exact match in snippet view article find links to article
Richard Erdoes (Hungarian Erdős, German Erdös) was born in Frankfurt, 7 July 1912, and died in Santa Fe, 16 July 2008. He was an artist, photographer
Combinatorics, Probability and Computing (370 words) [view diff] exact match in snippet view article find links to article
Babai, L. (1996), "In and out of Hungary: Paul Erdős, his friends, and times", Combinatorics, Paul Erdős is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc
Oded Schramm (1,225 words) [view diff] exact match in snippet view article find links to article
random turn hex) and the infinity Laplacian equation. Random permutations. Erdős Prize (1996) Salem Prize (2001) Clay Research Award (2002), for his work
Barabási–Albert model (2,602 words) [view diff] exact match in snippet view article find links to article
scale-free) degree distributions, while random graph models such as the Erdős–Rényi (ER) model and the Watts–Strogatz (WS) model do not exhibit power
Euler pseudoprime (485 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Ivan M. Niven (646 words) [view diff] exact match in snippet view article find links to article
Niven's theorem are named for Niven. He has an Erdős number of 1 because he coauthored a paper with Paul Erdős. Niven received the University of Oregon's
Attack tolerance (1,158 words) [view diff] no match in snippet view article find links to article
In the context of complex networks, attack tolerance is the network's robustness meaning the ability to maintain the overall connectivity and diameter
László Fejes Tóth (2,515 words) [view diff] exact match in snippet view article find links to article
Prize (1957) and State Award (1973). Together with H.S.M. Coxeter and Paul Erdős, he laid the foundations of discrete geometry. As described in a 1999 interview
Pentagonal number (821 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Yael Dowker (522 words) [view diff] exact match in snippet view article find links to article
cooperated on some of her work with the Hungarian mathematician Paul Erdős (Erdős' number of one). She worked with her husband with gifted children who
Joseph Kruskal (643 words) [view diff] exact match in snippet view article find links to article
Albert W. Tucker and Roger Lyndon,[citation needed] but de facto under Paul Erdős with whom he had two very short conversations. Kruskal worked on well-quasi-orderings
Half graph (599 words) [view diff] exact match in snippet view article find links to article
graph on the same vertices. The name was given to these graphs by Paul Erdős and András Hajnal. To define the half graph on 2 n {\displaystyle 2n} vertices
Square triangular number (1,668 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
22 (number) (1,574 words) [view diff] exact match in snippet view article
π, the ratio of the circumference of a circle to its diameter. 22 is an Erdős–Woods number, since it is possible to find sequences of 22 consecutive integers
Frobenius pseudoprime (2,031 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Stochastic block model (1,526 words) [view diff] exact match in snippet view article find links to article
{\displaystyle P_{ij}=p} for all i , j {\displaystyle i,j} , then the result is the Erdős–Rényi model G ( n , p ) {\displaystyle G(n,p)} . This case is degenerate—the
Stefan Ralescu (345 words) [view diff] exact match in snippet view article find links to article
the mathematics section of the PSC-CUNY Research Foundation. He has an Erdős number of 2. Ralescu is an Elected Fellow of the International Statistical
B-coloring (114 words) [view diff] exact match in snippet view article find links to article
relation between b-coloring and a graph's smallest cycle to partly prove the Erdős–Faber–Lovász conjecture. V. Campos, C. Lima, A. Silva: "b-coloring graphs
Automorphic number (1,184 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
Friendly number (1,161 words) [view diff] exact match in snippet view article find links to article
Superperfect Unitary perfect Bi-unitary multiply perfect Semiperfect Practical Erdős–Nicolas With many divisors Abundant Primitive abundant Highly abundant Superabundant
Selberg class (1,677 words) [view diff] exact match in snippet view article find links to article
surprising in that both Selberg and Erdős were present, with the story being that Selberg did not know that Erdős was to attend. Conrey & Ghosh 1993,
Dedekind number (1,691 words) [view diff] exact match in snippet view article find links to article
Other prime factor or divisor related numbers Blum Erdős–Nicolas Erdős–Woods Friendly Giuga Harmonic divisor Lucas–Carmichael Pronic Regular Rough Smooth
List of factorial and binomial topics (215 words) [view diff] exact match in snippet view article find links to article
Difference operator Difference polynomials Digamma function Egorychev method Erdős–Ko–Rado theorem Euler–Mascheroni constant Faà di Bruno's formula Factorial
Pamela J. Bjorkman (729 words) [view diff] exact match in snippet view article find links to article
investigate HIV/SIV infection in animal and human tissues. Pamela Bjorkman's Erdős number is two, based on publication of a structural and mathematical analysis
Random walk (7,698 words) [view diff] exact match in snippet view article find links to article
higher the probability decreases with the number of the dimensions. Paul Erdős and Samuel James Taylor also showed in 1960 that for dimensions less or
Kempner function (704 words) [view diff] exact match in snippet view article find links to article
the American Mathematical Monthly, set in 1991 and solved in 1994, Paul Erdős pointed out that the function S(n) coincides with the largest prime factor
Fencing at the 1972 Summer Olympics (79 words) [view diff] exact match in snippet view article find links to article
 France Győző Kulcsár  Hungary team épée details  Hungary (HUN) Sándor Erdős Csaba Fenyvesi Győző Kulcsár Pál Schmitt István Osztrics  Switzerland (SUI)
List of numbers (3,301 words) [view diff] exact match in snippet view article find links to article
Dictionary of Curious and Interesting Numbers" by David Wells, page 33 Erdős, P. (1948), "On arithmetical properties of Lambert series" (PDF), J. Indian
Katalin Marton (1,196 words) [view diff] exact match in snippet view article find links to article
concentration of measure, rate-distortion theory and graph capacity. Marton had an Erdős number of 2, for example via her collaboration with Imre Csiszár and László
Graph theory (6,212 words) [view diff] exact match in snippet view article find links to article
introduction of probabilistic methods in graph theory, especially in the study of Erdős and Rényi of the asymptotic probability of graph connectivity, gave rise