Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Robertson–Seymour_theorem> ?p ?o }
Showing triples 1 to 95 of
95
with 100 triples per page.
- Robertson–Seymour_theorem abstract "In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem) states that the undirected graphs, partially ordered by the graph minor relationship, form a well-quasi-ordering. Equivalently, every family of graphs that is closed under minors can be defined by a finite set of forbidden minors, in the same way that Wagner's theorem characterizes the planar graphs as being the graphs that do not have the complete graph K5 and the complete bipartite graph K3,3 as minors.The Robertson–Seymour theorem is named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of twenty papers spanning over 500 pages from 1983 to 2004. Before its proof, the statement of the theorem was known as Wagner's conjecture after the German mathematician Klaus Wagner, although Wagner said he never conjectured it.A weaker result for trees is implied by Kruskal's tree theorem, which was conjectured in 1937 by Andrew Vázsonyi and proved in 1960 independently by Joseph Kruskal and S. Tarkowski.".
- Robertson–Seymour_theorem wikiPageExternalLink Ch12.pdf.
- Robertson–Seymour_theorem wikiPageExternalLink quaddp1.pdf.
- Robertson–Seymour_theorem wikiPageExternalLink BL.pdf.
- Robertson–Seymour_theorem wikiPageID "351769".
- Robertson–Seymour_theorem wikiPageLength "18928".
- Robertson–Seymour_theorem wikiPageOutDegree "72".
- Robertson–Seymour_theorem wikiPageRevisionID "702638845".
- Robertson–Seymour_theorem wikiPageWikiLink American_Mathematical_Society.
- Robertson–Seymour_theorem wikiPageWikiLink Antichain.
- Robertson–Seymour_theorem wikiPageWikiLink Antisymmetric_relation.
- Robertson–Seymour_theorem wikiPageWikiLink Apex_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Branch-decomposition.
- Robertson–Seymour_theorem wikiPageWikiLink Cactus_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Category:Graph_minor_theory.
- Robertson–Seymour_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Robertson–Seymour_theorem wikiPageWikiLink Category:Wellfoundedness.
- Robertson–Seymour_theorem wikiPageWikiLink Closure_(mathematics).
- Robertson–Seymour_theorem wikiPageWikiLink Colin_de_Verdière_graph_invariant.
- Robertson–Seymour_theorem wikiPageWikiLink Complement_(set_theory).
- Robertson–Seymour_theorem wikiPageWikiLink Complete_bipartite_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Complete_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Constructive_proof.
- Robertson–Seymour_theorem wikiPageWikiLink Cubic_function.
- Robertson–Seymour_theorem wikiPageWikiLink Disjoint_union.
- Robertson–Seymour_theorem wikiPageWikiLink Feedback_vertex_set.
- Robertson–Seymour_theorem wikiPageWikiLink Forbidden_graph_characterization.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_(discrete_mathematics).
- Robertson–Seymour_theorem wikiPageWikiLink Graph_embedding.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_isomorphism.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_minor.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_property.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_structure_theorem.
- Robertson–Seymour_theorem wikiPageWikiLink Graph_theory.
- Robertson–Seymour_theorem wikiPageWikiLink Independence_(mathematical_logic).
- Robertson–Seymour_theorem wikiPageWikiLink Infinite_descending_chain.
- Robertson–Seymour_theorem wikiPageWikiLink Joseph_Kruskal.
- Robertson–Seymour_theorem wikiPageWikiLink Journal_of_the_ACM.
- Robertson–Seymour_theorem wikiPageWikiLink Klaus_Wagner.
- Robertson–Seymour_theorem wikiPageWikiLink Knot_(mathematics).
- Robertson–Seymour_theorem wikiPageWikiLink Kruskals_tree_theorem.
- Robertson–Seymour_theorem wikiPageWikiLink Linkless_embedding.
- Robertson–Seymour_theorem wikiPageWikiLink Manifold.
- Robertson–Seymour_theorem wikiPageWikiLink Maximal_element.
- Robertson–Seymour_theorem wikiPageWikiLink Neil_Robertson_(mathematician).
- Robertson–Seymour_theorem wikiPageWikiLink Outerplanar_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Parameterized_complexity.
- Robertson–Seymour_theorem wikiPageWikiLink Partially_ordered_set.
- Robertson–Seymour_theorem wikiPageWikiLink Path_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Pathwidth.
- Robertson–Seymour_theorem wikiPageWikiLink Paul_Seymour_(mathematician).
- Robertson–Seymour_theorem wikiPageWikiLink Peano_axioms.
- Robertson–Seymour_theorem wikiPageWikiLink Planar_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Preorder.
- Robertson–Seymour_theorem wikiPageWikiLink Pseudoforest.
- Robertson–Seymour_theorem wikiPageWikiLink Reflexive_relation.
- Robertson–Seymour_theorem wikiPageWikiLink Time_complexity.
- Robertson–Seymour_theorem wikiPageWikiLink Toroidal_graph.
- Robertson–Seymour_theorem wikiPageWikiLink Transitive_relation.
- Robertson–Seymour_theorem wikiPageWikiLink Tree_(graph_theory).
- Robertson–Seymour_theorem wikiPageWikiLink Treewidth.
- Robertson–Seymour_theorem wikiPageWikiLink Wagners_theorem.
- Robertson–Seymour_theorem wikiPageWikiLink Well-quasi-ordering.
- Robertson–Seymour_theorem wikiPageWikiLink Zermelo–Fraenkel_set_theory.
- Robertson–Seymour_theorem wikiPageWikiLink File:Petersen_family.svg.
- Robertson–Seymour_theorem wikiPageWikiLinkText "Graph Minors Project".
- Robertson–Seymour_theorem wikiPageWikiLinkText "Robertson–Seymour theorem".
- Robertson–Seymour_theorem wikiPageWikiLinkText "Robertson–Seymour_theorem#Obstruction_sets".
- Robertson–Seymour_theorem wikiPageWikiLinkText "graph minors and structure".
- Robertson–Seymour_theorem wikiPageWikiLinkText "minor-closed families of graphs".
- Robertson–Seymour_theorem wikiPageWikiLinkText "minor-closed family of graphs".
- Robertson–Seymour_theorem wikiPageWikiLinkText "minor-closed graph families".
- Robertson–Seymour_theorem wikiPageWikiLinkText "minor-closed graph family".
- Robertson–Seymour_theorem title "Robertson-Seymour Theorem".
- Robertson–Seymour_theorem urlname "Robertson-SeymourTheorem".
- Robertson–Seymour_theorem wikiPageUsesTemplate Template:Citation.
- Robertson–Seymour_theorem wikiPageUsesTemplate Template:Harvtxt.
- Robertson–Seymour_theorem wikiPageUsesTemplate Template:Main.
- Robertson–Seymour_theorem wikiPageUsesTemplate Template:Mathworld.
- Robertson–Seymour_theorem wikiPageUsesTemplate Template:Reflist.
- Robertson–Seymour_theorem subject Category:Graph_minor_theory.
- Robertson–Seymour_theorem subject Category:Theorems_in_graph_theory.
- Robertson–Seymour_theorem subject Category:Wellfoundedness.
- Robertson–Seymour_theorem type Redirect.
- Robertson–Seymour_theorem type Theorem.
- Robertson–Seymour_theorem comment "In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem) states that the undirected graphs, partially ordered by the graph minor relationship, form a well-quasi-ordering.".
- Robertson–Seymour_theorem label "Robertson–Seymour theorem".
- Robertson–Seymour_theorem sameAs Q3527155.
- Robertson–Seymour_theorem sameAs Minorentheorem.
- Robertson–Seymour_theorem sameAs Théorème_de_Robertson-Seymour.
- Robertson–Seymour_theorem sameAs Teorema_de_Robertson–Seymour.
- Robertson–Seymour_theorem sameAs m.01zcmv.
- Robertson–Seymour_theorem sameAs Q3527155.
- Robertson–Seymour_theorem wasDerivedFrom Robertson–Seymour_theorem?oldid=702638845.
- Robertson–Seymour_theorem isPrimaryTopicOf Robertson–Seymour_theorem.