In graph theory, the Robertson–Seymour theorem (also called the graph minors theorem) states that the undirected graphs, partially ordered by the graph...
21 KB (2,900 words) - 05:54, 2 June 2025
published over a span of many years, in which they proved the Robertson–Seymour theorem (formerly called Wagner's Conjecture). This states that families...
8 KB (747 words) - 23:42, 6 May 2025
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...
25 KB (2,783 words) - 11:45, 18 March 2025
04994. doi:10.1112/plms.12504. S2CID 259380697. Robertson–Seymour theorem Strong perfect graph theorem Seymour, Paul. "Online Papers". Retrieved 26 April 2013...
22 KB (2,285 words) - 19:10, 7 March 2025
theory of graph minors and can be seen as a forerunner of the Robertson–Seymour theorem. A planar embedding of a given graph is a drawing of the graph...
8 KB (925 words) - 22:42, 27 February 2025
2004, the result was generalized from trees to graphs as the Robertson–Seymour theorem, a result that has also proved important in reverse mathematics...
15 KB (1,855 words) - 00:04, 30 April 2025
published it in 1970. In the course of their proof, Seymour and Robertson also prove the graph structure theorem in which they determine, for any fixed graph...
35 KB (4,046 words) - 02:37, 30 December 2024
possible to find in polynomial time whether H is a minor of G. By Robertson–Seymour theorem, any set of finite graphs contains only a finite number of minor-minimal...
9 KB (1,271 words) - 02:23, 5 May 2025
forbidden minors; therefore, these two theorems are equivalent. An extension is the Robertson–Seymour theorem. Kelmans–Seymour conjecture, that 5-connected nonplanar...
9 KB (1,074 words) - 22:34, 27 February 2025
on graph minors leading to the Robertson–Seymour theorem and the graph structure theorem, Neil Robertson and Paul Seymour proved that a family F of finite...
7 KB (891 words) - 07:38, 20 April 2025
Tree decomposition. Robertson & Seymour 1991, Theorem 5.1, p. 168. Seymour & Thomas (1994). Robertson & Seymour (1991), Theorem 4.1, p. 164. Bodlaender...
21 KB (2,449 words) - 02:47, 16 March 2025
family must have bounded treewidth. The proof is based on a theorem of Robertson and Seymour that the families of graphs with unbounded treewidth have arbitrarily...
25 KB (3,146 words) - 20:27, 1 April 2025
Planar graph (redirect from Theorem P)
"forbidden minors". This is now the Robertson–Seymour theorem, proved in a long series of papers. In the language of this theorem, K5 and K3,3 are the forbidden...
35 KB (4,541 words) - 18:29, 29 May 2025
Friedman's SSCG function (category Theorems in discrete mathematics)
homeomorphically embeddable into (i.e. is a graph minor of) Gj. The Robertson–Seymour theorem proves that subcubic graphs (simple or not) are well-founded by...
3 KB (303 words) - 07:52, 14 May 2025
called a Kuratowski subgraph. A generalization, following from the Robertson–Seymour theorem, asserts that for each integer g, there is a finite obstruction...
8 KB (932 words) - 20:42, 18 May 2025
substructure is, this obstruction set could be infinite. The Robertson–Seymour theorem proves that, for the particular case of graph minors, a family...
17 KB (1,224 words) - 20:13, 16 April 2025
forbidden minors analogously to Wagner's theorem characterizing the planar graphs. Neil Robertson and Paul Seymour finally published a proof of Wagner's...
7 KB (559 words) - 02:04, 24 January 2025
Neil Robertson, Paul Seymour, and Robin Thomas was announced in 2002 and published by them in 2006. The proof of the strong perfect graph theorem won for...
15 KB (1,769 words) - 23:06, 16 October 2024
graph formed from G by contracting and removing edges. As the Robertson–Seymour theorem shows, many important families of graphs can be characterized...
7 KB (908 words) - 04:04, 25 September 2024
Tutte's spring theorem applies in this case. Toroidal graphs also have book embeddings with at most 7 pages. By the Robertson–Seymour theorem, there exists...
7 KB (696 words) - 09:57, 7 October 2024
MR 1427555, S2CID 14962541 Robertson, Neil; Sanders, Daniel P.; Seymour, Paul; Thomas, Robin (1997), "The Four-Colour Theorem", J. Combin. Theory Ser. B...
49 KB (6,277 words) - 23:39, 14 May 2025
concrete algorithm is known for solving them. For example, the Robertson–Seymour theorem guarantees that there is a finite list of forbidden minors that...
15 KB (1,940 words) - 10:17, 2 June 2025
endpoint along the path of the contracted edge. Therefore, by the Robertson–Seymour theorem, the linklessly embeddable graphs have a forbidden graph characterization...
29 KB (3,484 words) - 06:21, 9 January 2025
Vigoda, for approximating the permanent. Neil Robertson and Paul Seymour, for the Robertson–Seymour theorem showing that graph minors form a well-quasi-ordering...
21 KB (1,965 words) - 23:53, 11 August 2024
Ramsey's theorem (graph theory, combinatorics) Ringel–Youngs theorem (graph theory) Robbins' theorem (graph theory) Robertson–Seymour theorem (graph theory)...
78 KB (6,289 words) - 12:34, 6 June 2025
2007) Robertson–Seymour theorem (Neil Robertson, Paul Seymour, 2004) Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson, Paul Seymour and...
195 KB (20,069 words) - 07:07, 11 June 2025
improper Interval graph, proper Line graph Lollipop graph Minor Robertson–Seymour theorem Petersen graph Planar graph Dual polyhedron Outerplanar graph...
7 KB (663 words) - 02:52, 24 September 2024
minors; then it may be called a minor-hereditary property. The Robertson–Seymour theorem implies that a minor-hereditary property may be characterized...
13 KB (1,698 words) - 23:49, 14 April 2025
minor they do not allow deleting edges. For graph minors, the Robertson–Seymour theorem states that any graph property closed under minors has finitely...
13 KB (1,527 words) - 20:47, 9 June 2025
and therefore have a forbidden minor characterization (by the Robertson–Seymour theorem). The graphs of the Petersen family constitute some (but not all)...
8 KB (996 words) - 23:47, 11 January 2025