AbstractWe 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
There exist n-dimensional 0-1 polytopes with as many as ( cnlog n) n4 facets. This is our main resul...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
This is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at ...
AbstractWe prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimiza...
AbstractThere exist n-dimensional 0-1 polytopes with as many as (cnlogn)n/4 facets. This is our main...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
Let ci(n, d) be the number of i-dimensional faces of a cyclic d-polytope on n vertices. We present a...
There exist n-dimensional 0-1 polytopes with as many as ( cnlog n) n4 facets. This is our main resul...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
This is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at ...
AbstractWe prove two new upper bounds on the number of facets that a d -dimensional 0/1-polytope can...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
The main result of the Thesis is a lower bound for the maximal possible number of facets of a 0/1 po...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimiza...
AbstractThere exist n-dimensional 0-1 polytopes with as many as (cnlogn)n/4 facets. This is our main...
AbstractSince at least half of the d edges incident to a vertex v of a simple d-polytope P either al...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increa...
Let ci(n, d) be the number of i-dimensional faces of a cyclic d-polytope on n vertices. We present a...
There exist n-dimensional 0-1 polytopes with as many as ( cnlog n) n4 facets. This is our main resul...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
This is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at ...
DOI
Add to ORKG