In mathematics, the graph structure theorem is a major result in the area of graph theory. The result establishes a deep and fundamental connection between...

graph theory, the Robertson–Seymour theorem (also called the graph minor theorem) states that the undirected graphs, partially ordered by the graph minor...

conjectures involving graph minors include the graph structure theorem, according to which the graphs that do not have H as a minor may be formed by gluing...

Ore's theorems basically state that a graph is Hamiltonian if it has enough edges. The Bondy–Chvátal theorem operates on the closure cl(G) of a graph G with...

facts about connectivity in graphs is Menger's theorem, which characterizes the connectivity and edge-connectivity of a graph in terms of the number of...

underlying graph from vertices into edges, and by Whitney's theorem the same translation can also be done in the other direction. Line graphs are claw-free...

2-factor theorem (graph theory) 15 and 290 theorems (number theory) 2π theorem (Riemannian geometry) AF+BG theorem (algebraic geometry) ATS theorem (number...

In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a finite...

consequence, planar graphs also have treewidth and branch-width O(√n). The planar product structure theorem states that every planar graph is a subgraph of...

In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours)...