出典:Wikipedia
出典:『Wikipedia』 (2010/11/19 00:58 UTC 版)
Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher dimensional convex polytopes.