Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Upper_bound_theorem> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- Upper_bound_theorem abstract "In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given dimension and number of vertices. It is one of the central results of polyhedral combinatorics.Originally known as the upper bound conjecture, this statement was formulated by Theodore Motzkin, proved in 1970 by Peter McMullen, and strengthened from polytopes to subdivisions of a sphere in 1975 by Richard P. Stanley.".
- Upper_bound_theorem wikiPageID "40964551".
- Upper_bound_theorem wikiPageLength "3690".
- Upper_bound_theorem wikiPageOutDegree "14".
- Upper_bound_theorem wikiPageRevisionID "652044638".
- Upper_bound_theorem wikiPageWikiLink Category:Polyhedral_combinatorics.
- Upper_bound_theorem wikiPageWikiLink Convex_hull.
- Upper_bound_theorem wikiPageWikiLink Convex_polytope.
- Upper_bound_theorem wikiPageWikiLink Cyclic_polytope.
- Upper_bound_theorem wikiPageWikiLink Dehn–Sommerville_equations.
- Upper_bound_theorem wikiPageWikiLink H-vector.
- Upper_bound_theorem wikiPageWikiLink Moment_curve.
- Upper_bound_theorem wikiPageWikiLink Neighborly_polytope.
- Upper_bound_theorem wikiPageWikiLink Peter_McMullen.
- Upper_bound_theorem wikiPageWikiLink Polyhedral_combinatorics.
- Upper_bound_theorem wikiPageWikiLink Richard_P._Stanley.
- Upper_bound_theorem wikiPageWikiLink Stanley–Reisner_ring.
- Upper_bound_theorem wikiPageWikiLink Theodore_Motzkin.
- Upper_bound_theorem wikiPageWikiLink Vertex_(geometry).
- Upper_bound_theorem wikiPageWikiLinkText "upper bound theorem".
- Upper_bound_theorem wikiPageUsesTemplate Template:Main.
- Upper_bound_theorem wikiPageUsesTemplate Template:Reflist.
- Upper_bound_theorem subject Category:Polyhedral_combinatorics.
- Upper_bound_theorem comment "In mathematics, the upper bound theorem states that cyclic polytopes have the largest possible number of faces among all convex polytopes with a given dimension and number of vertices. It is one of the central results of polyhedral combinatorics.Originally known as the upper bound conjecture, this statement was formulated by Theodore Motzkin, proved in 1970 by Peter McMullen, and strengthened from polytopes to subdivisions of a sphere in 1975 by Richard P. Stanley.".
- Upper_bound_theorem label "Upper bound theorem".
- Upper_bound_theorem sameAs Q17104455.
- Upper_bound_theorem sameAs m.0ywy82d.
- Upper_bound_theorem sameAs Q17104455.
- Upper_bound_theorem wasDerivedFrom Upper_bound_theorem?oldid=652044638.
- Upper_bound_theorem isPrimaryTopicOf Upper_bound_theorem.