AbstractThe convex hull of the incidence vectors of the cycles of a binary matroid is studied. We prove that a description of the facets of this polytope can be obtained from a description of the facets that contain any given vertex. The facet-inducing inequalities are given for matroids with no F7∗, R10, or M(K5)∗ minor. We also characterize adjacency on this polytope
It is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Math. Soc. ...
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we i...
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every...
AbstractPrior work on the cycle polytopes P(M) of binary matroids M has almost exclusively concentra...
AbstractWe continue our previous study of the lattice (grid) generated by the incidence vectors of c...
AbstractGiven a matroid M on E and a nonnegative real vector x=(xj:j∈E), a fundamental problem is to...
AbstractFor k = 2 and 3, we define several k-sums of binary matroids and of polytopes arising from c...
AbstractIntrinsic characterizations of the faces of a matroid polytope from various subcollections o...
AbstractWe study the lattice (grid) generated by the incidence vectors of cocycles of a binary matro...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
AbstractThe purpose of this study is to provide a polyhedral analysis of the p-cycle polytope, which...
The purpose of this study is to provide a polyhedral analysis of the p-cycle polytope, which is the ...
AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements ca...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
It is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Math. Soc. ...
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we i...
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every...
AbstractPrior work on the cycle polytopes P(M) of binary matroids M has almost exclusively concentra...
AbstractWe continue our previous study of the lattice (grid) generated by the incidence vectors of c...
AbstractGiven a matroid M on E and a nonnegative real vector x=(xj:j∈E), a fundamental problem is to...
AbstractFor k = 2 and 3, we define several k-sums of binary matroids and of polytopes arising from c...
AbstractIntrinsic characterizations of the faces of a matroid polytope from various subcollections o...
AbstractWe study the lattice (grid) generated by the incidence vectors of cocycles of a binary matro...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
AbstractThe purpose of this study is to provide a polyhedral analysis of the p-cycle polytope, which...
The purpose of this study is to provide a polyhedral analysis of the p-cycle polytope, which is the ...
AbstractA base of the cycle space of a binary matroid M on E is said to be convex if its elements ca...
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as ...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
It is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Math. Soc. ...
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we i...
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every...
DOI
Add to ORKG