Matches in DBpedia 2016-04 for { ?s ?p "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."@en }
Showing triples 1 to 4 of
4
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.".
- Q17104455 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 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.".
- Q17104455 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.".