Browse By

All Combinatorics and Graph Theory

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

1950 1

All Combinatorics and Graph Theory

44 entries

Object Kind

Branch

Origin Era

Introduced By

1. Wikipedia: Combinatorics

Wikimedia FoundationHistory section

Quote, 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.

Algebraic connectivity

Bell Numbers

Betweenness Centrality

Catalan Number

Catalan Numbers

Cayley Graph

Centered Hexagonal Number

Chromatic Polynomial

Complete Graph

Crossing Number (Graph Theory)

De Bruijn Graph

Degeneracy (Graph Theory)

Degree Matrix

Derangement

Distance (Graph Theory)

Double Factorial

Euler Tour Technique

Falling and Rising Factorials

Graph Automorphism

Graph Bandwidth

Graph Isomorphism

Grötzsch Graph

Hamming Distance

Hamming weight

Heawood Graph

Hook Length Formula

Ihara Zeta Function

Integer Partition

Kneser Graph

Latin Square

Lovász Number

Mex (Mathematics)

Moser Spindle

Partial Permutation

Pascal's Triangle

Petersen Graph

Q-Pochhammer Symbol

Ramsey Numbers

Steiner System

Stirling Numbers

Treewidth

Turán Graph

Wheel Graph

Young Tableau