Live briefing
Everything about Graph structure theorem
Theorem relating graph minors and topological embeddings
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 the theory of graph minors and topological embeddings. The theorem is stated in the seventeenth of a series of 23 papers by Neil Robertson and Paul Seymour. Its proof is very long and involved. Kawarabayashi & Mohar (2007) and Lovász (2006) are surveys accessible to nonspecialists, describing the theorem and its consequences. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Graph structure theoremA 5-minute orientation
- Pick up a classic book: A course on large deviations with an introduction to Gibbs measuresThe most-reprinted book on the subject
- Read the landmark paper: Complex brain networks: graph theoretical analysis of structural and functional systemsCited 10,598 times
- Go sideways: Graph minorA closely related topic
- Go sideways: Clique-sumA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Complex brain networks: graph theoretical analysis of structural and functional systems
An Improved Planar Graph Product Structure Theorem
Complete graph minors and the graph minor structure theorem
Optimizing the Graph Minors Weak Structure Theorem
A Theorem about the Algebraic Structure underlying Orthogonal Graph Invariants
Treewidth 2 in the Planar Graph Product Structure Theorem
Graph Structures and the Whitney Theorem
đź“š Books worth reading
A course on large deviations with an introduction to Gibbs measuresFiras Rassoul-Agha · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Graph minor In graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting…
- Clique-sum In graph theory, a branch of mathematics, a clique sum (or clique-sum) is a way of combining two graphs by gluing them together at a clique, analogous…
- Kelmans–Seymour conjecture In graph theory, the Kelmans–Seymour conjecture states that every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex complete…
- Klaus Wagner Klaus Wagner (March 31, 1910 – February 6, 2000) was a German mathematician known for his contributions to graph theory. Wagner studied topology at the…
- Hadwiger conjecture (graph theory) Unsolved problem in mathematics Does every graph with chromatic number k have a k-vertex complete graph as a minor? More unsolved problems in mathematics…
- Branch-decomposition In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree…
- Matroid minor In the mathematical theory of matroids, a minor of a matroid M is another matroid N that is obtained from M by a sequence of restriction and contraction…
- Paul Seymour (mathematician) Paul D. Seymour FRS (born 1950) is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible…