AbstractA polyhedron P has the Integer Carathéodory Property if the following holds. For any positive integer k and any integer vector w∈kP, there exist affinely independent integer vectors x1,…,xt∈P and positive integers n1,…,nt such that n1+⋯+nt=k and w=n1x1+⋯+ntxt.In this paper we prove that if P is a (poly)matroid base polytope or if P is defined by a totally unimodular matrix, then P and projections of P have the Integer Carathéodory Property. For the matroid base polytope this answers a question by Cunningham from 1984
Given a polyhedron P subset R n we write P I for the convex hull of the integral points in P. It is ...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
A polyhedron $P$ has the Integer Carath\'eodory Property if the following holds. For any positive in...
In this paper we investigate the number of integer points lying in dilations of lattice path matroid...
This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we...
htmlabstractWe call a matrix $A$ nearly totally unimodular if it can be obtained from a totally unim...
This paper extends results on the cardinality constrained matroid polytope presented in [Maurras, J....
AbstractConsider the following question introduced by McMullen: Determine the largest integern=f(d) ...
A 2010 result of Amini provides a way to extract information about the structure of the graph from t...
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every...
We give an upper bound on the number of vertices of PI, the integer hull of a polyhedron P, in terms...
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not...
peer reviewedA polyhedron is box-integer if its intersection with any integer box {ℓ≤x≤u} is integer...
AbstractIn this paper it is shown that a certain class of (0–1) polyhedra, which includes the matroi...
Given a polyhedron P subset R n we write P I for the convex hull of the integral points in P. It is ...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
A polyhedron $P$ has the Integer Carath\'eodory Property if the following holds. For any positive in...
In this paper we investigate the number of integer points lying in dilations of lattice path matroid...
This thesis is a study of the faces of certain combinatorially defined polyhedra. In particular, we...
htmlabstractWe call a matrix $A$ nearly totally unimodular if it can be obtained from a totally unim...
This paper extends results on the cardinality constrained matroid polytope presented in [Maurras, J....
AbstractConsider the following question introduced by McMullen: Determine the largest integern=f(d) ...
A 2010 result of Amini provides a way to extract information about the structure of the graph from t...
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every...
We give an upper bound on the number of vertices of PI, the integer hull of a polyhedron P, in terms...
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not...
peer reviewedA polyhedron is box-integer if its intersection with any integer box {ℓ≤x≤u} is integer...
AbstractIn this paper it is shown that a certain class of (0–1) polyhedra, which includes the matroi...
Given a polyhedron P subset R n we write P I for the convex hull of the integral points in P. It is ...
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a p...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...