- Atlas
- Mathematics
- Combinatorics
Combinatorics
Combinatorics is the mathematics of finite arrangement: of choosing, ordering, matching, colouring, and counting discrete objects.
15 frameworks, from 1650 to today · Combinatorics · Mathematics
- Enumerative Combinatorics 1650-Present
- Graph Theory 1736-Present
- Generating Functions 1740-Present
- Combinatorial design 1847-Present
- Algebraic Combinatorics 1930-Present
- Ramsey Theory 1930-Present
- Discrete geometry 1935-Present
- Matroid 1935-Present
- Extremal Combinatorics 1941-Present
- Probabilistic Method 1947-Present
- Combinatorial Optimization 1950-Present
- Additive Combinatorics 1975-Present
- Analytic Combinatorics 1990-Present
- Analytic Combinatorics 1990-Present
- Graph Limits 2006-Present
Overview
Combinatorics is the mathematics of finite arrangement: of choosing, ordering, matching, colouring, and counting discrete objects1. Its questions are often easy to state—how many ways can a set be partitioned? how many colours does a map need? how large can a collection of subsets be before some pattern is forced?—and often surprisingly hard to answer. What unites the field is not a single method but a habit of mind: build a finite structure, ask an extremal or enumerative question about it, and then find the right tool, whether that tool is a generating function, a linear-algebra argument, a random experiment, or a polynomial.
For most of its history combinatorics was a scatter of techniques serving other sciences—gambling, astronomy, cryptography, scheduling. Only in the twentieth century did it become a discipline with its own problems, journals, and identity, and only in the last few decades did it acquire the deep structural theories that now tie its branches together1.
Counting and Chance in the Early Modern World
The oldest strand is enumeration. Indian mathematicians of the first millennium, including Pingala and later commentators on prosody, studied the arrangements of long and short syllables and the binomial coefficients that count them; the Bhagavati Sutra (c. 300 BCE) discusses combinations of philosophical categories. In the Islamic world, al-Khalil and later al-Biruni and Omar Khayyam worked with binomial coefficients and combinatorial identities. These were tools for metre, astronomy, and algebra rather than a subject in itself.
The decisive early modern turn came from gambling. In a 1654 correspondence, Blaise Pascal and Pierre de Fermat solved the "problem of points": how to divide the stakes of an interrupted game fairly. Their methods—Pascal's arithmetic triangle and Fermat's enumeration of equally likely outcomes—founded probability and, with it, systematic combinatorial counting. Jacob Bernoulli's Ars Conjectandi (published 1713) and Abraham de Moivre's Doctrine of Chances (1718) built permutations and combinations into the working apparatus of probability. Leonhard Euler, in the eighteenth century, gave the field some of its most durable objects: the Euler characteristic of polyhedra, the enumeration of partitions, and the solution of the Königsberg bridge problem (1736), which asked whether a walk could cross each of seven bridges exactly once. Euler's answer—no, because vertices of odd degree must be endpoints—is usually taken as the birth of graph theory.
Partitions, Generating Functions, and the Rise of Formal Counting
Euler's work on partitions introduced the device that would organise enumerative combinatorics for two centuries: the generating function, a formal power series whose coefficients encode the numbers being counted2. The number of partitions of n is the coefficient of xⁿ in the product ∏(1 − xᵏ)⁻¹; Euler used this to prove his pentagonal number theorem, a striking identity that also gave a recurrence for partition numbers. The method was refined by James Joseph Sylvester and Arthur Cayley in the nineteenth century, and by Percy MacMahon, whose two-volume Combinatory Analysis (1915–16) was the first comprehensive treatise on the subject. MacMahon systematised the enumeration of permutations, partitions, and Latin squares, and his work on symmetric functions fed directly into invariant theory.
A parallel tradition grew in design theory. In 1847 the Reverend Thomas Kirkman posed the "schoolgirl problem": arrange fifteen girls in groups of three for seven days so that every pair meets exactly once. This is a Steiner triple system, and the general question—when does a balanced incomplete block design exist?—became a central combinatorial problem. The most famous instance is the design of experiments: Ronald Fisher, in the 1920s and 1930s, developed randomised block designs and Latin squares as statistical tools, and the combinatorial theory of designs was subsequently built by Raj Chandra Bose, S. S. Shrikhande, and others. The nonexistence of a finite projective plane of order 10, settled by a massive computer search completed in 1989, shows how far such questions can reach.
Graphs, Maps, and the Four-Colour Problem
Graph theory developed slowly as a collection of puzzles until the twentieth century. The four-colour conjecture, posed by Francis Guthrie in 1852, asked whether every planar map can be coloured with four colours so that adjacent regions differ. It resisted proof for over a century and drove the development of graph theory as a discipline: Percy Heawood proved the five-colour theorem in 1890, and the study of planarity, duality, and chromatic polynomials grew around the problem. Kenneth Appel and Wolfgang Haken finally proved the four-colour theorem in 1976 with a computer-assisted case analysis, a landmark that also provoked debate about what counts as a proof.
Meanwhile graph theory acquired its structural core. Dénes Kőnig's Theorie der endlichen und unendlichen Graphen (1936) was the first book-length treatment3. The 1930s also brought the first great extremal theorem: Pál Turán's 1941 result determining the maximum number of edges in a graph with no complete subgraph of a given size4. Turán's theorem opened extremal graph theory, which asks how large a structure can be before a forbidden pattern must appear. Paul Erdős and Alfréd Rényi's work on random graphs in the late 1950s and 1960s gave the field a probabilistic dimension, and Erdős's collaboration with countless mathematicians made him the field's central figure.
The Probabilistic Method and the Extremal Turn
In 1947 Erdős gave a proof that there exist graphs with arbitrarily large chromatic number and arbitrarily large girth (shortest cycle)—a result that had seemed impossible, since high chromatic number usually comes from dense local structure. His argument was startlingly simple: choose edges at random, and show that with positive probability the resulting graph has both properties. This was the birth of the probabilistic method, which proves existence by showing that a random object has the desired property with nonzero probability5. The method, later codified in Erdős and Joel Spencer's book Probabilistic Methods in Combinatorics (1974), became one of the most powerful tools in the field, and it underlies the modern theory of random graphs, the study of thresholds, and the analysis of randomised algorithms.
Extremal set theory grew alongside. Erdős, Chao Ko, and Richard Rado's 1961 theorem determined the largest family of k-element subsets of an n-element set with no two nested—a result that launched a large industry of forbidden-configuration theorems6. The 1970s and 1980s saw the rise of algebraic methods in extremal problems: linear-algebra arguments, eigenvalue bounds, and polynomial methods. The 2010s brought the container method, developed by József Balogh, Robert Morris, and Wojciech Samotij (and independently by David Saxton and Andrew Thomason), which gives a general way to bound the number of independent sets and to transfer extremal results from dense to sparse settings.
Ramsey Theory: Order Out of Chaos
Ramsey theory is the study of unavoidable patterns: how large must a structure be before some regular configuration appears17? Frank Ramsey's 1930 paper proved that in any sufficiently large complete graph whose edges are coloured with finitely many colours, there is a monochromatic complete subgraph. The finite version, and the associated Ramsey numbers, became a central object of study. Erdős and George Szekeres in 1935 proved that any sufficiently long sequence of distinct numbers contains a monotone subsequence of a given length, and the Erdős–Szekeres theorem on convex polygons followed. The probabilistic method gave lower bounds on Ramsey numbers that remain essentially the best known: Erdős's 1947 argument shows that the diagonal Ramsey number grows at least exponentially, while the best upper bounds are far larger. The gap between the two is one of the field's most famous open problems.
Ramsey theory broadened into a general programme: van der Waerden's theorem (1927) on arithmetic progressions in colourings, the Hales–Jewett theorem (1963) on combinatorial lines, and the density version proved by Endre Szemerédi in 1975—that any set of positive density contains arbitrarily long arithmetic progressions—which became a bridge between combinatorics, number theory, and ergodic theory. Szemerédi's proof introduced the regularity lemma, a structural decomposition of large graphs that has become a cornerstone of extremal combinatorics4.
Algebraic and Analytic Combinatorics
The twentieth century also saw combinatorics become algebraic and analytic1. Algebraic combinatorics attaches algebraic objects—groups, rings, representations, polynomials—to discrete structures and reads off consequences18. The representation theory of the symmetric group, developed by Alfred Young and others, is intimately tied to the combinatorics of partitions and tableaux; the Robinson–Schensted correspondence, discovered in the 1930s and 1960s, gives a bijection between permutations and pairs of standard tableaux that explains many enumerative identities. Gian-Carlo Rota's work in the 1960s and 1970s on Möbius inversion and incidence algebras gave the field a unifying algebraic language, and Richard Stanley's Enumerative Combinatorics (1986, 1999) became its standard reference. In the 1980s and 1990s, the theory of cluster algebras (Sergey Fomin and Andrei Zelevinsky, 2002) and the study of combinatorial commutative algebra brought combinatorics into contact with modern algebraic geometry and representation theory.
Analytic combinatorics, by contrast, uses complex analysis to extract asymptotic information from generating functions19. The tradition goes back to Euler and was developed in the twentieth century by researchers including Philippe Flajolet and Robert Sedgewick, whose Analytic Combinatorics (2009) systematised the method: singularities of a generating function determine the growth rate of its coefficients, so counting problems become problems in complex analysis. This made it possible to answer questions about the typical shape of large random structures—trees, permutations, maps—with precision.
Matroids, Optimisation, and the Computational Turn
Matroid theory, introduced by Hassler Whitney in 1935, abstracts the notion of linear independence: a matroid is a finite set with a family of "independent" subsets satisfying axioms modelled on vectors. Matroids unify graphs, linear algebra, and transversal theory, and they became central to combinatorial optimisation. The greedy algorithm—choose the best available element at each step—works precisely for matroids, a fact that connects the theory to scheduling and network design.
Combinatorial optimisation as a field grew from operations research in the mid-twentieth century. Linear programming (George Dantzig, 1947) and the simplex method provided a general framework, and the recognition that many combinatorial problems are computationally hard led to the theory of NP-completeness (Stephen Cook, 1971; Richard Karp, 1972). The travelling salesman problem, the matching problem, and network flow became test cases for algorithmic ideas. Jack Edmonds's work on matchings and polyhedral combinatorics in the 1960s showed that some hard-looking problems have elegant polynomial algorithms, and the theory of matroid intersection generalised this. Today combinatorial optimisation is a large field spanning approximation algorithms, integer programming, and the design of heuristics.
Geometry, Limits, and the Modern Synthesis
Combinatorial geometry studies finite configurations of points, lines, and convex sets. The Erdős–Szekeres theorem on convex polygons, the Sylvester–Gallai theorem (every finite non-collinear point set has an ordinary line), and the study of arrangements and polytopes are classical. In the 1980s and 1990s, the polynomial method—using algebraic geometry to bound combinatorial configurations—revived the field; the solution of the Erdős–Moser problem and the joints problem are examples. Discrepancy theory, which asks how evenly a finite set can be distributed, grew from the 1980s work of Joel Spencer and others.
The most recent structural development is the theory of graph limits. László Lovász and Balázs Szegedy, building on earlier work on quasirandomness and the regularity lemma, introduced in the mid-2000s the notion of a graphon—a symmetric measurable function on the unit square that is the limit of a convergent sequence of dense graphs. Graph limits give a continuous language for extremal and enumerative questions, and they connect combinatorics to functional analysis and probability. The theory has since been extended to sparse graphs and to hypergraphs, and it underlies much current work on property testing and large networks.
The Present
Combinatorics today is a sprawling, fast-moving field with strong internal connections and deep ties to computer science, probability, algebra, and geometry. The classical branches—enumeration, extremal theory, graph theory, design theory, Ramsey theory—remain active, often transformed by new methods: the probabilistic method and the container method in extremal problems, algebraic and polynomial techniques in geometry and combinatorics, analytic methods in enumeration, and graph limits in the study of large structures. Additive combinatorics, which studies sumsets and arithmetic progressions, has become a major area in its own right, with Szemerédi's theorem, the Green–Tao theorem on primes in arithmetic progressions (2004), and the polynomial method as landmarks. The field's open questions—the exact growth of Ramsey numbers, the existence of finite projective planes of certain orders, the complexity of combinatorial optimisation problems, the structure of large random graphs—remain as inviting as they were when Euler counted partitions and Erdős asked how large a graph must be to force a triangle.
References
- Combinatorics (introduction, Definition, History, Extremal combinatorics, Algebraic combinatorics, Analytic combinatorics), Wikipedia
- Generating function (History), Wikipedia
- Graph theory (History), Wikipedia
- Extremal graph theory (History), Wikipedia
- Probabilistic method, Wikipedia
- Erdős–Ko–Rado theorem (introduction, History), Wikipedia
- Ramsey theory, Wikipedia
- Algebraic combinatorics, Wikipedia
- Analytic combinatorics, Wikipedia
The frameworks of Combinatorics
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1650-Present
Enumerative Combinatorics
How many arrangements of a finite set are there?
- 1736-Present
Graph Theory
What structure do points and connections between them have?
About Graph Theory
Graph theory began with a simple question: can you cross every bridge in Königsberg exactly once and return to your starting point? Leonhard Euler’s 1736 answer—no, because the underlying structure of landmasses and bridges lacked the right kind of connectivity—marked a fundamental shift in combinatorics. Where earlier frameworks asked “how many?”, graph theory asked “is it possible?” and “what is the structure?”. This reframing turned combinatorics from an art of counting into a science of relations, and graph theory became the language for modeling pairwise connections in everything from social networks to molecular bonds.At its core, graph theory studies graphs: collections of vertices (points) and edges (lines connecting pairs of vertices). The curriculum begins with the basic building blocks. A graph is defined by its vertices and edges; a path is a sequence of edges connecting vertices without repetition; a cycle is a closed path; a tree is a connected graph with no cycles. From these, we classify special families: bipartite graphs whose vertices can be split into two sets with edges only between the sets, and planar graphs that can be drawn without edge crossings. Next come properties that characterize graphs: graph coloring assigns colors to vertices so that adjacent vertices differ, matching pairs vertices with edges without sharing vertices, and connectivity measures how many vertices or edges must be removed to disconnect the graph. Two classic traversal problems define the field’s early ambitions: an Eulerian trail uses every edge exactly once (the Königsberg problem), while a Hamiltonian path visits every vertex exactly once. To compare graphs, we use graph isomorphism to decide if two graphs are structurally identical, and we describe graphs numerically through their degree sequence (list of vertex degrees) and adjacency matrix (table of edge connections). The complete graph, where every pair of vertices is connected, serves as a reference point for extremal questions.Graph theory’s intellectual history begins with Euler’s 1736 paper on the Königsberg bridges, which introduced the concept of a graph and solved the first graph theory problem. For the next century, the field grew slowly, with isolated results such as the enumeration of trees by Arthur Cayley (1857) and William Rowan Hamilton’s Icosian game (1859), which popularized Hamiltonian paths. In the late 19th and early 20th centuries, graph theory matured: Gustav Kirchhoff used graphs to analyze electrical circuits, and the four-color conjecture (first posed in 1852) drove research into graph coloring. A major milestone was Kazimierz Kuratowski’s 1930 characterization of planar graphs, which gave a clean condition for when a graph can be drawn without crossings. The mid-20th century saw graph theory absorb ideas from other frameworks: the probabilistic method (Erdős–Rényi random graphs), Ramsey theory (guaranteed substructures), and extremal graph theory (Turán’s theorem on maximum edges without a clique). These interactions enriched graph theory without replacing its core focus on connectivity and structure. Today, graph theory remains a vibrant framework, coexisting with and supplying tools to fields like combinatorial optimization, spectral graph theory, and network science.The 15 concepts its tower teaches
- Adjacency Matrix
- Bipartite Graph
- Complete Graph
- Connectivity
- Cycle
- Degree Sequence
- Eulerian Trail
- Graph
- Graph Coloring
- Graph Isomorphism
- Hamiltonian Path
- Matching
- Path
- Planar Graph
- Tree
- 1740-Present
Generating Functions
How can a sequence of counts be encoded as one series?
- 1847-Present
- 1930-Present
- 1930-Present
- 1935-Present
Discrete geometry
What can be said about arrangements of points, lines and shapes?
- 1935-Present
- 1941-Present
Extremal Combinatorics
How large can a structure be without a forbidden pattern?
About Extremal Combinatorics
Extremal combinatorics asks a fundamental question: given a finite collection of objects—graphs, sets, vectors, or integers—and a set of restrictions, what is the largest or smallest possible size of such a collection? This framework shifts the focus from counting all configurations (as in enumerative combinatorics) or determining existence (as in graph theory) to finding the extreme boundaries of possibility. It emerged in the mid-20th century, largely through the work of Paul Erdős and his collaborators, and has since become a central pillar of combinatorics, with deep connections to probability, geometry, and computer science.At its core, extremal combinatorics divides into two broad branches: extremal graph theory and extremal set theory. The curriculum begins with Turán-type problems, which ask how many edges a graph can have without containing a given subgraph. This leads naturally to forbidden subgraph problems and the Zarankiewicz problem, which concerns bipartite graphs. In set theory, the foundational result is Sperner's theorem, which gives the largest family of subsets of an -element set with no subset containing another. From there, the Erdős–Ko–Rado theorem bounds the size of intersecting families of -element subsets, and the sunflower lemma provides a structural tool for families with small intersections. The Lubell–Yamamoto–Meshalkin inequality offers a probabilistic proof of Sperner's theorem, while Dilworth's theorem characterizes chain decompositions in partially ordered sets. The Kruskal–Katona theorem gives a precise bound on the number of -element subsets in a family of -element sets, and the Sauer–Shelah lemma relates the size of a family to its VC-dimension. Fisher's inequality and the Union-closed sets conjecture round out the core, the latter remaining a famous open problem.The intellectual history of extremal combinatorics begins with Pál Turán's 1941 theorem on the maximum number of edges in a graph without a subgraph, which is often taken as the birth of extremal graph theory. Paul Erdős, working with Turán and others, rapidly expanded the field, introducing the probabilistic method as a powerful tool for existence proofs. The Erdős–Ko–Rado theorem (1961) became a landmark in extremal set theory, and the subsequent decades saw a flood of results: the Kruskal–Katona theorem (1968), the Sauer–Shelah lemma (1972), and the formulation of the Union-closed sets conjecture (1979). The framework coexists with Ramsey theory (which guarantees order in large structures) and the probabilistic method (which often provides the best known bounds). Today, extremal combinatorics remains an active area, with open problems like the Union-closed sets conjecture and the Erdős–Hajnal conjecture driving research.The 12 concepts its tower teaches
- Dilworth's theorem
- Erdős–Ko–Rado theorem
- Fisher's inequality
- Forbidden subgraph problems
- Kruskal–Katona theorem
- Lubell–Yamamoto–Meshalkin inequality
- Sauer–Shelah lemma
- Sperner's theorem
- Sunflower lemma
- Turán-type problems
- Union-closed sets conjecture
- Zarankiewicz problem
- 1947-Present
Probabilistic Method
Can a random construction prove that an object exists?
- 1950-Present
Combinatorial Optimization
How do we find the best arrangement among finitely many?
- 1975-Present
- 1990-Present
- 1990-Present
- 2006-Present
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Generating Functions grew out of Enumerative Combinatorics
Euler's partition enumeration produced the formal power series whose coefficients count partitions, making the generating function the organising device of counting. Later enumerators took up the same device as their standard technique.
Carried by Leonhard Euler.
Extremal Combinatorics grew out of Graph Theory
Turán's theorem on the maximum number of edges in a graph with no complete subgraph of given size opened extremal graph theory, which grew directly out of graph-theoretic questions about forbidden subgraphs.
Carried by Pál Turán.
Analytic Combinatorics grew out of Generating Functions
Analytic combinatorics turned the formal generating functions of enumerative combinatorics into complex-analytic objects, reading asymptotic counts off singularities of the series.
Carried by Philippe Flajolet; Robert Sedgewick.
Combinatorial design influenced by Enumerative Combinatorics
Systematic counting of arrangements of elements into blocks supplied the language and questions of block designs, as in Kirkman's schoolgirl problem of arranging triples so every pair occurs once.
Carried by Thomas Kirkman.
Ramsey Theory influenced by Graph Theory
Ramsey's theorem was stated and proved for colourings of complete graphs, so the finite Ramsey numbers and their study took their object from graph theory.
Carried by Frank Ramsey.
Matroid influenced by Graph Theory
Matroid theory abstracted the notion of independence from graphs and linear algebra, taking cycles and spanning forests of graphs as one of its founding models.
Carried by Hassler Whitney.
Algebraic Combinatorics influenced by Generating Functions
Generating functions for symmetric functions and partitions, as systematised by MacMahon, became the computational language through which algebraic structures were attached to discrete objects.
Carried by Percy MacMahon.
Probabilistic Method influenced by Ramsey Theory
Erdős's probabilistic lower bounds for Ramsey numbers were the first application of the random-graph existence argument, which became the core of the probabilistic method.
Carried by Paul Erdős.
Graph Limits influenced by Extremal Combinatorics
Graph limit theory grew out of extremal graph theory, giving a convergence notion for dense graph sequences that makes extremal quantities continuous functionals.
Carried by László Lovász; Balázs Szegedy.
Combinatorial Optimization influenced by Probabilistic Method
Randomised arguments and probabilistic analysis of algorithms became part of the toolkit of combinatorial optimisation, used to bound and approximate hard discrete problems.
Algebraic Combinatorics influenced by Combinatorial design
Designs and their incidence structures were among the discrete configurations whose symmetry groups and association schemes algebraic combinatorics later studied.
Graph Limits influenced by Probabilistic Method
The theory of graph limits drew on probabilistic and sampling ideas about large random graphs to define convergence of dense graph sequences.
Carried by László Lovász.
Beyond the field
Where Combinatorics's ideas came from in other fields, and what they led to there: the strongest 12 of 117 links.
Enumerative Combinatorics led to Computer-Assisted and Automated Enumeration in Enumerative Combinatorics
Computer-assisted enumeration grew directly out of classical enumerative combinatorics: the same counting problems, recurrences and generating functions were turned into algorithms and run on machines. The subfield is a computational branch of enumerative combinatorics.
Enumerative Combinatorics led to Combinatorial Species in Algebraic Combinatorics
Combinatorial species arose within enumerative combinatorics as a structural foundation for counting labelled structures, generalising the generating-function methods of the field. It is a branch of that tradition.
Carried by André Joyal.
Enumerative Combinatorics led to Analytic Combinatorics in Enumerative Combinatorics
Analytic combinatorics is a branch of enumerative combinatorics that studies counting sequences through their generating functions and analytic singularities. It grew out of the enumerative tradition as a systematic asymptotic method.
Graph Theory led to Matching Theory in Graph Algorithms
Matching theory grew directly out of graph theory: matchings are sets of independent edges, and König's and Egerváry's work on matchings in bipartite graphs in the early 1930s founded the subfield within graph theory.
Carried by Dénes Kőnig; Jenő Egerváry.
Graph Theory led to Algorithmic and combinatorial optimisation on graphs in Graph Theory
Algorithmic and combinatorial optimisation on graphs is a branch of graph theory, taking graph structures as its domain and developing algorithms for problems defined on them.
Graph Theory led to Algebraic graph theory in Graph Theory
Algebraic graph theory is a branch of graph theory, taking the objects of the parent field and studying them with algebraic machinery.
Graph Theory led to Graph enumeration in Graph Theory
Graph enumeration is a subfield of graph theory, counting the objects (graphs, trees, maps) that the parent field defines; it developed as graph theory turned to systematic counting.
Carried by Arthur Cayley.
Graph Theory led to Graph traversal and connectivity in Graph Algorithms
Graph traversal and connectivity is a branch of graph theory: connectivity, blocks and traversal orderings are graph-theoretic notions.
Carried by Robert Tarjan.
Graph Theory led to Graph coloring in Graph Theory
Graph colouring arose as a problem posed within graph theory: the four-colour question about maps was framed in terms of colouring the regions of a planar graph, and became a central strand of the field.
Carried by Francis Guthrie; Augustus De Morgan.
Graph Theory led to Graphon in Graph Theory
Graphon theory grew directly out of graph theory, generalising finite graphs to limit objects and using subgraph densities and homomorphism counts as its basic tools. Lovász and Szegedy built the theory on classical graph-theoretic notions.
Carried by László Lovász; Balázs Szegedy.
Graph Theory led to Structural graph theory and graph minors in Graph Theory
Structural graph theory and graph minors is a branch of graph theory, growing out of the classical study of planarity, connectivity and Kuratowski-type characterisations. Robertson and Seymour's minor project is the culmination of that tradition.
Carried by Neil Robertson; Paul Seymour.
Graph Theory influenced Extremal Graph Theory in Extremal Combinatorics
Turán's theorem and the extremal problems that followed were formulated entirely within graph theory, taking the graph as the object whose edge count is maximised under forbidden subgraphs.
Carried by Paul Turán.

Combinatorics is a planet in Nousfarer
Its city has a tower for each of these 15 frameworks. Land, walk in, and climb one concept at a time.
Land on CombinatoricsRelated fields
Fields its ideas are linked to
- Extremal Combinatorics 12 links
- Graph Theory 11 links
- Enumerative Combinatorics 10 links
- Probabilistic Combinatorics 10 links
- Discrete Geometry 8 links
- Algebraic Combinatorics 6 links
- Design Theory 5 links
- Convex Geometry 5 links
- Analytic Number Theory 5 links
- Graph Algorithms 4 links
- Matroid Theory 4 links
- Combinatorial Optimization 3 links