Linked from

The 48 pages that link to Combinatorics, each with the reason it gives.

• Graph theoryNarrower topic: Graph theory is a major area within the broader study of discrete structures.

• PermutationNarrower topic: Permutations are a basic object for counting ordered arrangements.

• Paul ErdősNarrower topic: Many of Erdős’s central questions concerned how large or complex discrete structures must be.

• FactorialNarrower topic: Factorials became a basic counting tool in the development of combinatorics.

• Power setNarrower topic: Counting subsets is a basic combinatorial problem.

• Pigeonhole principleNarrower topic: The principle is a basic counting tool within this broader field.

• Finite setNarrower topic: Its basic problems ask for the sizes and arrangements of finite sets.

• Inclusion–exclusion principleNarrower topic: The principle is a central general-purpose method within this broader field.

• MultisetNarrower topic: Multisets model selections where an object can be chosen more than once.

• Catalan numberNarrower topic: Catalan numbers are a central sequence in enumerative combinatorics.

• Probabilistic methodNarrower topic: The method emerged as a general proof strategy for questions about discrete structures.

• Recreational mathematicsNarrower topic: Many puzzles ask how many configurations exist or whether any satisfy given constraints.

• Birthday ProblemNarrower topic: Counting distinct birthday assignments underlies the probability calculation.

• George PólyaNarrower topic: Many of Pólya’s influential results concern counting and discrete mathematical structures.

• Stirling numbers of the second kindNarrower topic: These numbers are a central counting sequence within enumerative combinatorics.

• Jakob BernoulliNarrower topic: Counting methods underpin the probability problems Bernoulli analyzed.

• Stars and barsNarrower topic: Stars and bars is a basic technique for counting discrete allocations.

• David GaleNarrower topic: Matching is a discrete structure at the heart of Gale’s joint result.

• Integer sequenceNarrower topic: Many integer sequences are counts of combinatorial objects.

• OulipoNarrower topic: Oulipo draws on combinatorial structures to organize literary possibilities.

• q-seriesNarrower topic: Combinatorial interpretations often explain the coefficients of q-series.

• Bell numberNarrower topic: Bell numbers became a central counting sequence within enumerative combinatorics.

• HemachandraNarrower topic: His enumeration of metrical combinations is an early counting problem.

• Latin squareNarrower topic: Latin squares are central objects in enumerative and structural combinatorics.

• Mathematical puzzleNarrower topic: Many puzzles hinge on counting possibilities or proving that none were missed.

• Multinomial theoremNarrower topic: Counting arrangements gives a direct explanation for the expansion’s coefficients.

• Pólya enumeration theoremNarrower topic: The theorem became a central tool for counting discrete structures modulo symmetry.

• Brute-force attackNarrower topic: Counting possible inputs estimates the work required to test them all.

• Dilworth's theoremNarrower topic: The theorem is a central extremal result about finite order structures.

• Lambert W functionNarrower topic: Generating functions involving tree-like structures can produce equations solved with Lambert W.

• Erdős–Szekeres theorem (monotone subsequences)Narrower topic: The theorem became a foundational example of a simple, sharp guarantee in finite arrangements.

• Metcalfe's lawNarrower topic: Counting user pairs gives the quadratic relationship behind the law.

• Sperner's theoremNarrower topic: The theorem became a central example of a sharp combinatorial extremal bound.

• Ramon LlullNarrower topic: The Art’s letter combinations anticipate a systematic, combinatorial approach to reasoning.

• Szemerédi regularity lemmaNarrower topic: The lemma is a foundational structural theorem in extremal graph combinatorics.

• Bertrand's ballot theoremNarrower topic: The theorem reduces a probability to counting favorable and total vote orders.

• NonogramNarrower topic: Counting clue-compatible patterns reveals whether a line has forced cells.

• Richard K. GuyNarrower topic: Combinatorial methods underlie both Guy’s game theory and many of his other interests.

• Zeckendorf's theoremNarrower topic: The theorem connects integer representations with counting restricted subsets.

• Cheryl PraegerNarrower topic: Her work links algebraic group structure with discrete objects and their symmetries.

• Erdős–Gyárfás conjectureNarrower topic: The conjecture emerged from questions about unavoidable structures in finite graphs.

• Generalized Petersen graphNarrower topic: The family connects graph structure with counting, symmetry, and extremal questions.