Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Kruskals_tree_theorem> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples per page.
- Kruskals_tree_theorem abstract "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). The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960); a short proof was given by Nash-Williams (1963).Higman's lemma is a special case of this theorem, of which there are many generalizations involving trees with a planar embedding, infinite trees, and so on. A generalization from trees to arbitrary graphs is given by the Robertson–Seymour theorem.".
- Kruskals_tree_theorem wikiPageExternalLink S0002-9947-1960-0111704-1.pdf.
- Kruskals_tree_theorem wikiPageID "3606300".
- Kruskals_tree_theorem wikiPageLength "7013".
- Kruskals_tree_theorem wikiPageOutDegree "28".
- Kruskals_tree_theorem wikiPageRevisionID "705621729".
- Kruskals_tree_theorem wikiPageWikiLink Ackermann_function.
- Kruskals_tree_theorem wikiPageWikiLink Ackermann_ordinal.
- Kruskals_tree_theorem wikiPageWikiLink Andrew_Vázsonyi.
- Kruskals_tree_theorem wikiPageWikiLink Category:Mathematical_logic.
- Kruskals_tree_theorem wikiPageWikiLink Category:Order_theory.
- Kruskals_tree_theorem wikiPageWikiLink Category:Theorems_in_discrete_mathematics.
- Kruskals_tree_theorem wikiPageWikiLink Category:Trees_(graph_theory).
- Kruskals_tree_theorem wikiPageWikiLink Category:Wellfoundedness.
- Kruskals_tree_theorem wikiPageWikiLink Fast-growing_hierarchy.
- Kruskals_tree_theorem wikiPageWikiLink Feferman–Schütte_ordinal.
- Kruskals_tree_theorem wikiPageWikiLink Goodsteins_theorem.
- Kruskals_tree_theorem wikiPageWikiLink Grahams_number.
- Kruskals_tree_theorem wikiPageWikiLink Higmans_lemma.
- Kruskals_tree_theorem wikiPageWikiLink Homeomorphism_(graph_theory).
- Kruskals_tree_theorem wikiPageWikiLink Hyperoperation.
- Kruskals_tree_theorem wikiPageWikiLink Kanamori–McAloon_theorem.
- Kruskals_tree_theorem wikiPageWikiLink Mathematics.
- Kruskals_tree_theorem wikiPageWikiLink Paris–Harrington_theorem.
- Kruskals_tree_theorem wikiPageWikiLink Peano_axioms.
- Kruskals_tree_theorem wikiPageWikiLink Primitive_recursive_function.
- Kruskals_tree_theorem wikiPageWikiLink Robertson–Seymour_theorem.
- Kruskals_tree_theorem wikiPageWikiLink Second-order_arithmetic.
- Kruskals_tree_theorem wikiPageWikiLink Small_Veblen_ordinal.
- Kruskals_tree_theorem wikiPageWikiLink Tree_(graph_theory).
- Kruskals_tree_theorem wikiPageWikiLink Tree_(set_theory).
- Kruskals_tree_theorem wikiPageWikiLink Well-quasi-ordering.
- Kruskals_tree_theorem wikiPageWikiLinkText "Friedman's TREE".
- Kruskals_tree_theorem wikiPageWikiLinkText "Kruskal's tree theorem".
- Kruskals_tree_theorem wikiPageWikiLinkText "TREE(3)".
- Kruskals_tree_theorem authorlink "Crispin St. J. A. Nash-Williams".
- Kruskals_tree_theorem authorlink "Harvey Friedman".
- Kruskals_tree_theorem authorlink "Joseph Kruskal".
- Kruskals_tree_theorem date "February 2015".
- Kruskals_tree_theorem first "Joseph".
- Kruskals_tree_theorem last "Friedman".
- Kruskals_tree_theorem last "Kruskal".
- Kruskals_tree_theorem last "Nash-Williams".
- Kruskals_tree_theorem reason "how exactly is the homeomorphic embedding defined for labeled trees with wqo-ordered labels; the article this links to doesn't cover that case".
- Kruskals_tree_theorem txt "yes".
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Citation.
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Clarify.
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Harvs.
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Large_numbers.
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Note_label.
- Kruskals_tree_theorem wikiPageUsesTemplate Template:Ref_label.
- Kruskals_tree_theorem year "1960".
- Kruskals_tree_theorem year "1963".
- Kruskals_tree_theorem year "2002".
- Kruskals_tree_theorem subject Category:Mathematical_logic.
- Kruskals_tree_theorem subject Category:Order_theory.
- Kruskals_tree_theorem subject Category:Theorems_in_discrete_mathematics.
- Kruskals_tree_theorem subject Category:Trees_(graph_theory).
- Kruskals_tree_theorem subject Category:Wellfoundedness.
- Kruskals_tree_theorem type Field.
- Kruskals_tree_theorem type Redirect.
- Kruskals_tree_theorem type Theorem.
- Kruskals_tree_theorem comment "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). The theorem was conjectured by Andrew Vázsonyi and proved by Joseph Kruskal (1960); a short proof was given by Nash-Williams (1963).Higman's lemma is a special case of this theorem, of which there are many generalizations involving trees with a planar embedding, infinite trees, and so on.".
- Kruskals_tree_theorem label "Kruskal's tree theorem".
- Kruskals_tree_theorem sameAs Q3527100.
- Kruskals_tree_theorem sameAs Teorema_de_los_árboles_de_Kruskal.
- Kruskals_tree_theorem sameAs Théorème_de_Kruskal.
- Kruskals_tree_theorem sameAs m.09pjg1.
- Kruskals_tree_theorem sameAs Q3527100.
- Kruskals_tree_theorem wasDerivedFrom Kruskals_tree_theorem?oldid=705621729.
- Kruskals_tree_theorem isPrimaryTopicOf Kruskals_tree_theorem.