Linked from

The 46 pages that link to Paul Erdős, each with the reason it gives.

• Ramsey theoryRelated: His collaborations and lower-bound methods drove major advances in Ramsey numbers.

• Random graphRelated: His work with Rényi established foundational probabilistic methods for graph structure.

• Probabilistic methodRelated: Erdős’s proofs established the method’s reach, especially in Ramsey theory.

• Stanisław UlamRelated: Ulam and Erdős belonged to overlapping mathematical circles and shared interests in combinatorics and probability.

• Bertrand's postulateRelated: His 1932 proof made the postulate's proof notably elementary.

• Extremal combinatoricsRelated: His problems and papers established many of the field's central themes.

• Network scienceRelated: His work helped make random graphs a central model of network structure.

• Menger's theoremRelated: His work with Alfréd Rényi helped extend Menger-type connectivity results.

• Terence TaoRelated: Tao’s solution of the discrepancy problem answered a question posed by Erdős.

• Ramsey's theoremRelated: His work with George Szekeres developed finite Ramsey theory and its bounds.

• Atle SelbergRelated: Erdős collaborated with Selberg on the elementary proof of the prime number theorem.

• Endre SzemerédiRelated: Erdős posed influential problems in extremal combinatorics that shaped Szemerédi’s research.

• Erdős–Ko–Rado theoremRelated: He co-formulated the theorem and helped establish its early proof.

• Mathematical conjectureRelated: Erdős posed many conjectures that shaped research across mathematics.

• Richard RadoRelated: Erdős and Rado shared influential work on Ramsey theory and infinite combinatorics.

• Szemerédi–Trotter theoremRelated: Erdős posed the point–line incidence problem that led to the theorem.

• Turán's theoremRelated: His later results extended the extremal questions that Turán's theorem made central.

• Collatz conjectureRelated: He remarked on the apparent difficulty of problems like this despite their elementary statements.

• Erdős–Stone theoremRelated: He co-developed the theorem that bears his name and shaped its probabilistic perspective.

• Erdős–Szekeres theorem (monotone subsequences)Related: He co-authored the 1935 paper that established the theorem with George Szekeres.

• Erdős–Rado theoremRelated: He co-developed the theorem and the partition-calculus program.

• Erdős–Straus conjectureRelated: Erdős posed the conjecture jointly with Ernst G. Straus.

• Lovász local lemmaRelated: Erdős introduced the lemma with László Lovász to prove a graph-coloring result.

• Sylvester–Gallai theoremRelated: He published a short proof of the theorem in 1943.

• Szemerédi regularity lemmaRelated: His problems and collaborations helped define the combinatorial setting in which the lemma became influential.

• Erdős–Faber–Lovász conjectureRelated: He posed the coloring problem with V. Faber and L. Lovász.

• Erdős–Gallai theorem (degree sequences)Related: He co-authored the degree-sequence criterion bearing his name.

• Erdős–Kac theoremRelated: Erdős co-authored the theorem establishing the normal law for prime-factor counts.

• History of combinatoricsRelated: His problems and methods helped make combinatorics a central modern mathematical field.

• Big-line-big-clique conjectureRelated: Erdős posed the problem as part of his program on geometric configurations.

• Burr–Erdős conjectureRelated: Erdős formulated the sparse-graph Ramsey problem with Burr.

• Cameron–Erdős conjectureRelated: Erdős co-formulated the conjecture and helped establish its additive-combinatorial context.

• Conway's thrackle conjectureRelated: Erdős helped bring attention to the problem in combinatorial graph theory.

• De Bruijn–Erdős theorem (graph theory)Related: He co-authored the theorem with de Bruijn.

• Dinitz theoremRelated: Erdős and colleagues popularized the conjecture and offered a prize for its solution.

• Erdős–Anning theoremRelated: Erdős posed the integer-distance question that the theorem resolves.

• Erdős–Graham problemRelated: Erdős posed the problem jointly with Graham as a question about reciprocal sums.

• Erdős–Gyárfás conjectureRelated: He co-formulated the problem with András Gyárfás.

• Erdős–Mordell inequalityRelated: He posed the inequality that bears his name.

• Erdős–Nagy theoremRelated: He posed the polygon-convexification problem that led to the theorem.

• Erdős–Pósa theoremRelated: He co-authored the theorem establishing the cycle packing-covering relation.

• Erdős–Szemerédi theoremRelated: He posed the sum-product problem with Szemerédi.

• Friends and strangers theoremRelated: His probabilistic methods became central to estimating larger Ramsey numbers.

• Grimm's conjectureRelated: Erdős proposed Grimm's conjecture in a 1969 paper.

• List coloring conjectureRelated: Erdős introduced the list-coloring conjecture with collaborators.

• Thébault's theoremRelated: His name is associated with several related geometric problems involving erected squares.