Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Kruskal's_tree_theorem> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Kruskal's_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 byJoseph 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.".
- Kruskal's_tree_theorem wikiPageID "3606300".
- Kruskal's_tree_theorem wikiPageRevisionID "604374302".
- Kruskal's_tree_theorem authorlink "Crispin St. J. A. Nash-Williams".
- Kruskal's_tree_theorem authorlink "Harvey Friedman".
- Kruskal's_tree_theorem authorlink "Joseph Kruskal".
- Kruskal's_tree_theorem first "Joseph".
- Kruskal's_tree_theorem hasPhotoCollection Kruskal's_tree_theorem.
- Kruskal's_tree_theorem last "Friedman".
- Kruskal's_tree_theorem last "Kruskal".
- Kruskal's_tree_theorem last "Nash-Williams".
- Kruskal's_tree_theorem txt "yes".
- Kruskal's_tree_theorem year "1960".
- Kruskal's_tree_theorem year "1963".
- Kruskal's_tree_theorem year "2002".
- Kruskal's_tree_theorem subject Category:Mathematical_logic.
- Kruskal's_tree_theorem subject Category:Order_theory.
- Kruskal's_tree_theorem subject Category:Theorems_in_discrete_mathematics.
- Kruskal's_tree_theorem subject Category:Trees_(graph_theory).
- Kruskal's_tree_theorem subject Category:Wellfoundedness.
- Kruskal's_tree_theorem type Abstraction100002137.
- Kruskal's_tree_theorem type Communication100033020.
- Kruskal's_tree_theorem type Message106598915.
- Kruskal's_tree_theorem type Proposition106750804.
- Kruskal's_tree_theorem type Statement106722453.
- Kruskal's_tree_theorem type Theorem106752293.
- Kruskal's_tree_theorem type TheoremsInDiscreteMathematics.
- Kruskal's_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 byJoseph 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.".
- Kruskal's_tree_theorem label "Kruskal's tree theorem".
- Kruskal's_tree_theorem label "Théorème de Kruskal".
- Kruskal's_tree_theorem sameAs Théorème_de_Kruskal.
- Kruskal's_tree_theorem sameAs m.09pjg1.
- Kruskal's_tree_theorem sameAs Q3527100.
- Kruskal's_tree_theorem sameAs Q3527100.
- Kruskal's_tree_theorem sameAs Kruskal's_tree_theorem.
- Kruskal's_tree_theorem wasDerivedFrom Kruskal's_tree_theorem?oldid=604374302.
- Kruskal's_tree_theorem isPrimaryTopicOf Kruskal's_tree_theorem.