Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3527155> ?p ?o }
Showing triples 1 to 65 of
65
with 100 triples per page.
- Q3527155 subject Q7494515.
- Q3527155 subject Q8146252.
- Q3527155 subject Q8498914.
- Q3527155 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.".
- Q3527155 wikiPageExternalLink Ch12.pdf.
- Q3527155 wikiPageExternalLink quaddp1.pdf.
- Q3527155 wikiPageExternalLink BL.pdf.
- Q3527155 wikiPageWikiLink Q10310588.
- Q3527155 wikiPageWikiLink Q1188853.
- Q3527155 wikiPageWikiLink Q131476.
- Q3527155 wikiPageWikiLink Q1396427.
- Q3527155 wikiPageWikiLink Q1400918.
- Q3527155 wikiPageWikiLink Q141488.
- Q3527155 wikiPageWikiLink Q1425985.
- Q3527155 wikiPageWikiLink Q1475294.
- Q3527155 wikiPageWikiLink Q1531456.
- Q3527155 wikiPageWikiLink Q1570441.
- Q3527155 wikiPageWikiLink Q16667694.
- Q3527155 wikiPageWikiLink Q1699014.
- Q3527155 wikiPageWikiLink Q1709878.
- Q3527155 wikiPageWikiLink Q191849.
- Q3527155 wikiPageWikiLink Q203920.
- Q3527155 wikiPageWikiLink Q2393193.
- Q3527155 wikiPageWikiLink Q242767.
- Q3527155 wikiPageWikiLink Q245673.
- Q3527155 wikiPageWikiLink Q2705017.
- Q3527155 wikiPageWikiLink Q272735.
- Q3527155 wikiPageWikiLink Q2894153.
- Q3527155 wikiPageWikiLink Q303100.
- Q3527155 wikiPageWikiLink Q3044470.
- Q3527155 wikiPageWikiLink Q3115604.
- Q3527155 wikiPageWikiLink Q3115609.
- Q3527155 wikiPageWikiLink Q3527100.
- Q3527155 wikiPageWikiLink Q431937.
- Q3527155 wikiPageWikiLink Q45715.
- Q3527155 wikiPageWikiLink Q465654.
- Q3527155 wikiPageWikiLink Q4720939.
- Q3527155 wikiPageWikiLink Q474715.
- Q3527155 wikiPageWikiLink Q4779442.
- Q3527155 wikiPageWikiLink Q4956329.
- Q3527155 wikiPageWikiLink Q5067368.
- Q3527155 wikiPageWikiLink Q5467387.
- Q3527155 wikiPageWikiLink Q547823.
- Q3527155 wikiPageWikiLink Q5597085.
- Q3527155 wikiPageWikiLink Q5597098.
- Q3527155 wikiPageWikiLink Q583760.
- Q3527155 wikiPageWikiLink Q621850.
- Q3527155 wikiPageWikiLink Q64861.
- Q3527155 wikiPageWikiLink Q6554389.
- Q3527155 wikiPageWikiLink Q7144893.
- Q3527155 wikiPageWikiLink Q722659.
- Q3527155 wikiPageWikiLink Q7254793.
- Q3527155 wikiPageWikiLink Q7494515.
- Q3527155 wikiPageWikiLink Q7959587.
- Q3527155 wikiPageWikiLink Q8146252.
- Q3527155 wikiPageWikiLink Q842620.
- Q3527155 wikiPageWikiLink Q842755.
- Q3527155 wikiPageWikiLink Q8498914.
- Q3527155 wikiPageWikiLink Q905837.
- Q3527155 wikiPageWikiLink Q913598.
- Q3527155 wikiPageWikiLink Q917421.
- Q3527155 wikiPageWikiLink Q96013.
- Q3527155 wikiPageWikiLink Q983361.
- Q3527155 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.".
- Q3527155 label "Robertson–Seymour theorem".