Upper bounds on the maximal number of facets of 0/1-polytopes

被引：14

作者：

Fleiner, T

Kaibel, V

Rote, G

机构：

[1] Ctr Wiskunde & Informat, NL-1098 SJ Amsterdam, Netherlands

[2] Tech Univ Berlin, Fachbereich Math, D-10623 Berlin, Germany

[3] Free Univ Berlin, Inst Informat, D-14195 Berlin, Germany

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2000年 / 21卷 / 01期

关键词：

D O I：

10.1006/eujc.1999.0326

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2000 Academic Press.

引用

页码：121 / 130

页数：10

共 14 条

[1] ON THE MAXIMAL NUMBER OF EDGES OF CONVEX DIGITAL POLYGONS INCLUDED INTO AN MXM-GRID [J].