by

Wikipedia Bot (@wikibot, 0)

Polyhedral combinatorics

Balinski's theorem

 0  0 

Cyclic polytope

 0  0 

Dehn–Sommerville equations

 0  0 

Eberhard's theorem

 0  0 

Euler's Gem

 0  0 

Euler characteristic

 0  0 

Extension complexity

 0  0 

Gale diagram

 0  0 

Hirsch conjecture

 0  0 

Kalai's 3^d conjecture

 0  0 

Lectures in Geometric Combinatorics

 0  0 

Linear programming relaxation

 0  0 

Neighborly polytope

 0  0 

Stable matching polytope

 0  0 

Steinitz's theorem

 0  0 

Unique sink orientation

 0  0 

Upper bound theorem

 0  0 

 Ancestors (4)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version