Graph Theory

In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.

In mathematics, Tutte's homotopy theorem, introduced by Tutte (1958), generalises the concept of "path" from graphs to matroids, and states roughly that closed paths can be written as compositions of elementary closed paths, so that in some sense they are homotopic to the trivial closed path.

In the mathematical discipline of graph theory, the 2-factor theorem, discovered by Julius Petersen, is one of the earliest works in graph theory.

In graph theory, the De Bruijn-Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs.

at least as large as the number of sets in the subset. The graph theoretic formulation answers whether a finite

In the mathematical discipline of graph theory, Menger's theorem says that in a finite graph

In graph theory, Turán's theorem bounds the number of edges that

In graph theory, Kuratowski's theorem is a mathematical forbidden

In graph theory, Brooks' theorem states a relationship between

In graph theory, Vizing's theorem states that every simple undirected

In the mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree

In mathematics, Cayley's formula is a result in graph theory named after Arthur Cayley. It states that for

Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein

In graph theory, Robbins' theorem, named after Herbert Robbins

In the mathematical discipline of graph theory, the Tutte theorem, named after William Thomas

In graph theory, the Robertson-Seymour theorem (also called the

The Erdős-Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides

In graph theory, the handshaking lemma is the statement that

In extremal graph theory, Szemerédi's regularity lemma states that a graph

In graph theory, Wagner's theorem is a mathematical forbidden

In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen

In graph theory, Berge's theorem states that a matching M in

In extremal graph theory, the Erdős-Stone theorem is an asymptotic result

convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected

mathematics, Balinski's theorem is a statement about the graph-theoretic structure of three-dimensional convex polyhedra

In the mathematical discipline of graph theory the Tutte-Berge formula is a characterization

In the mathematical field of graph theory, Fáry's theorem states that any simple, planar

In the study of graph algorithms, Courcelle's theorem is the statement that every

In graph theory and polyhedral combinatorics, areas of mathematics

In the mathematics of graph drawing, the crossing number inequality or crossing lemma

In graph theory, approximate max-flow min-cut theorems concern

In graph theory, a part of discrete mathematics, the BEST theorem

In the mathematical discipline of graph theory, the Erdős-Pósa theorem, named after Paul Erdős

The five color theorem is a result from graph theory that given a plane separated into regions, such

graph structure theorem is a major result in the area of graph theory. The result establishes a deep and fundamental

In graph theory, Grinberg's theorem is a necessary condition

In the mathematical field of graph theory, Grötzsch's theorem is the statement that every

In graph theory, the perfect graph theorem of László Lovász (1972a

In graph theory, the planar separator theorem is a form of isoperimetric

In graph theory, the Heawood conjecture or Ringel-Youngs theorem

In graph theory, Schnyder's theorem is a characterization of

In graph theory, the strong perfect graph theorem is a forbidden