Named combinatorial constructions and graphs famous enough to be studied as individual objects. Belongs here: Pascal's Triangle, the triangular array of binomial coefficients; the Petersen Graph, the standard small counterexample graph in graph theory, cited across independent problems for its symmetry and its girth. Does not belong here: the general theory of counting or graphs, the branch entity Combinatorics and Graph Theory, and finite geometric configurations such as the Fano Plane, filed under Geometry below because that is the cluster its own live SubLabel already carries even though it can also be described combinatorially.
Facts
Comparison
Era Of Emergence Browse By
Sources
1. Wikipedia: Combinatorics
Wikimedia FoundationHistory sectionQuote, History section
In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.