Home›Combinatorics and Graph Theory›All Combinatorics and Graph TheoryBrowse ByAll Combinatorics and Graph TheoryReference and ClassificationDevelopingProved results in combinatorics and graph theory: counting, matching, coloring, connectivity and extremal theorems about finite discrete structures. Belongs here: theorem entities whose subject is combinatorics or graph theory. Does not belong here: the branch-level Combinatorics and Graph Theory entity itself, a different entity of a different type.FactsAll Combinatorics and Graph TheorySourcesComments (0)Reader Challenges (0)FactsComparisonEra Of EmergenceWell-attested1950 1All Combinatorics and Graph TheoryFilter Results99 entriesBranchAllAlgebra (1)Coding Theory (2)Combinatorics (34)Computational Complexity Theory (1)Geometry (1)Graph Theory (47)Group Theory (1)Linear Algebra (3)Logic and Foundations (1)Number Theory (2)Set Theory (1)Topic AreaAllBinomial and Summation Identities (1)Combinatorial Matrix Theory (1)Combinatorics of Computing and Classification (2)Enumerative, Additive and Algebraic Combinatorics (22)Graph Theory (46)Ramsey Theory and Extremal Combinatorics (16)Tilings and Board Coverings (1)ProvedAll1736 (1)1847 (1)1860 (1)1877 (1)1878 (1)1890 (1)1891 (2)1897 (1)1907 (1)1916 (1)1922 (1)1927 (3)1928 (1)1930 (2)1931 (1)1935 (2)1936 (1)1937 (1)1939 (1)1940 (1)1941 (2)1946 (2)1948 (1)1949 (1)1950 (1)1952 (2)1954 (2)1955 (1)1956 (1)1957 (1)1958 (2)1959 (1)1960 (4)1961 (3)1964 (1)1965 (1)1966 (1)1968 (2)1969 (1)1970 (1)1971 (1)1972 (2)1973 (2)1974 (1)1975 (2)1978 (1)1979 (1)1982 (1)1988 (1)1989 (1)1990 (1)1994 (1)2002 (1)2004 (1)2016 (1)2019 (1)Proved ByAllAnton Kotzig (1)Arthur Cayley (1)Augustin-Louis Cauchy (1)Bartel Leendert van der Waerden (1)Bruno Courcelle (1)Claude Berge (2)Désiré André (1)Edgar Gilbert (1)Emanuel Grinberg (1)Emanuel Sperner (2)Endre Szemerédi (4)Ernst Steinitz (1)Ferdinand Georg Frobenius (1)Frank P. Ramsey (1)Garrett Birkhoff (1)George Pólya (1)Gerhard Ringel (1)Gustav Kirchhoff (1)Hao Huang (1)Henryk Minc (1)Herbert John Ryser (1)Herbert Robbins (1)Issai Schur (1)J. W. T. Youngs (1)Jeff Dinitz (1)Joachim Lambek (1)John Adrian Bondy (1)Joseph Kruskal (2)Julius Petersen (2)Karl Menger (1)Kazimierz Kuratowski (1)Klaus Wagner (2)Leo Moser (1)Leon Mirsky (1)Leonhard Euler (1)László Lovász (2)Michel Balinski (1)Neil Robertson (3)Nicolaas Govert de Bruijn (2)Niels Henrik Abel (1)Paul Erdos (8)Paul Seymour (3)Percy Alexander MacMahon (1)Percy John Heawood (1)Philip Hall (1)Pál Turán (1)R. Leonard Brooks (1)Richard Bruck (1)Robert P. Dilworth (1)Ronald Fisher (1)Vadim G. Vizing (1)W. T. Tutte (5)William Allen Whitworth (1)Zsolt Baranyai (1)Øystein Ore (1)Named AfterAllArthur Cayley (1)Edgar Gilbert (1)Niels Henrik Abel (1)Statement FormAllCharacterization (21)Equation (20)Existence Theorem (30)Identity (20)Impossibility Theorem (2)Inequality (29)Uniqueness Theorem (2)Proved By (Other Fields)AllGustav Kirchhoff (1)Show ResultsBrowseCompareSelect all 502-Factor TheoremCombinatorics and Graph TheoryAbel's Binomial TheoremCombinatorics and Graph TheoryApproximate Max-Flow Min-Cut TheoremCombinatorics and Graph TheoryAztec Diamond TheoremCombinatorics and Graph TheoryBalinski's TheoremCombinatorics and Graph TheoryBaranyai's TheoremCombinatorics and Graph TheoryBerge's TheoremCombinatorics and Graph TheoryBertrand's Ballot TheoremCombinatorics and Graph TheoryBEST TheoremCombinatorics and Graph TheoryBirkhoff-von Neumann TheoremCombinatorics and Graph TheoryBondy-Chvatal TheoremCombinatorics and Graph TheoryBondy's TheoremCombinatorics and Graph TheoryBoolean Pythagorean Triples ProblemCombinatorics and Graph TheoryBregman-Minc InequalityCombinatorics and Graph TheoryBrooks' TheoremCombinatorics and Graph TheoryBruck-Ryser-Chowla TheoremCombinatorics and Graph TheoryBurnside's LemmaCombinatorics and Graph TheoryCameron-Erdos TheoremCombinatorics and Graph TheoryCayley's FormulaCombinatorics and Graph TheoryChvatal-Erdos TheoremCombinatorics and Graph TheoryCorners TheoremCombinatorics and Graph TheoryCourcelle's TheoremCombinatorics and Graph TheoryCrossing Number InequalityCombinatorics and Graph TheoryDe Bruijn-Erdos Theorem (Graph Theory)Combinatorics and Graph TheoryDe Bruijn-Erdos Theorem (Incidence Geometry)Combinatorics and Graph TheoryDilworth's TheoremCombinatorics and Graph TheoryDinitz TheoremCombinatorics and Graph TheoryDirac's TheoremCombinatorics and Graph TheoryDobiński's FormulaCombinatorics and Graph TheoryElias Bassalygo BoundCombinatorics and Graph TheoryErdos-Gallai TheoremCombinatorics and Graph TheoryErdos-Ko-Rado TheoremCombinatorics and Graph TheoryErdos-Posa TheoremCombinatorics and Graph TheoryErdos-Rado TheoremCombinatorics and Graph TheoryErdos-Stone TheoremCombinatorics and Graph TheoryErdos-Szekeres TheoremCombinatorics and Graph TheoryFary's TheoremCombinatorics and Graph TheoryFisher's InequalityCombinatorics and Graph TheoryFive Color TheoremCombinatorics and Graph TheoryFreiman's TheoremCombinatorics and Graph TheoryFriendship TheoremCombinatorics and Graph TheoryGilbert-Varshamov BoundCombinatorics and Graph TheoryGomory's TheoremCombinatorics and Graph TheoryGraph Structure TheoremCombinatorics and Graph TheoryGrinberg's TheoremCombinatorics and Graph TheoryGrotzsch's TheoremCombinatorics and Graph TheoryHajnal-Szemerédi TheoremCombinatorics and Graph TheoryHales-Jewett TheoremCombinatorics and Graph TheoryHall's Marriage TheoremCombinatorics and Graph TheoryHandshaking LemmaCombinatorics and Graph Theory12Next →Sources1. Wikipedia: Combinatoricstier 2Wikimedia FoundationHistory sectionQuote, History sectionIn the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.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.