Name
Abstract | ||
|---|---|---|
We prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can have. The first one is 2(d− 1)!+ 2(d− 1) (which is the best one currently known for small dimensions), while the second one of O((d− 2)!) is the best known bound for large dimensions. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1006/eujc.1999.0326 | European Journal of Combinatorics |
Keywords | Field | DocType |
upper bound | Discrete mathematics,Combinatorics,Polytope,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 1 | 0195-6698 |
Citations | PageRank | References |
9 | 1.97 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamás Fleiner | 1 | 241 | 27.45 |
| Volker Kaibel | 2 | 285 | 27.28 |
| Günter Rote | 3 | 1181 | 129.29 |