Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Erdős–Stone_theorem> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Erdős–Stone_theorem abstract "In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946, and it has been described as the “fundamental theorem of extremal graph theory”.".
- Erdős–Stone_theorem wikiPageID "10836468".
- Erdős–Stone_theorem wikiPageRevisionID "551320740".
- Erdős–Stone_theorem subject Category:Extremal_graph_theory.
- Erdős–Stone_theorem subject Category:Paul_Erdős.
- Erdős–Stone_theorem subject Category:Theorems_in_graph_theory.
- Erdős–Stone_theorem comment "In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946, and it has been described as the “fundamental theorem of extremal graph theory”.".
- Erdős–Stone_theorem label "Erdős–Stone theorem".
- Erdős–Stone_theorem sameAs Erd%C5%91s%E2%80%93Stone_theorem.
- Erdős–Stone_theorem sameAs Q5385326.
- Erdős–Stone_theorem sameAs Q5385326.
- Erdős–Stone_theorem wasDerivedFrom Erdős–Stone_theorem?oldid=551320740.