Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the circuits of the Fano matroid F7 that contain a given element. Let be a binary clutter on E and let d = 2 be an integer. We prove that all the vertices of the polytope {x E+ | x(C) = 1 for C } n {x | a = x = b} are -integral, for any -integral a, b, if and only if does not have Q6 or Q7 as a minor. This includes the class of ports of regular matroids. Applications to graphs are presented, extending a result from Laurent and Pojiak [7]
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
AbstractLet Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting...
Let M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
Let M be a matroid on E ∪ {l}, where l ∉ E is a distinguished element of M. The l-port of M is the s...
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits ...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
We verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a bin...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
The τ=2 Conjecture, the Replication Conjecture and the f-Flowing Conjecture, and the classification ...
Given a graph G = (V; E), the metric polytope S(G) is defined by the inequalities x(F ) \Gamma x(C n...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
AbstractLet Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting...
Let M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
Let M be a matroid on E ∪ {l}, where l ∉ E is a distinguished element of M. The l-port of M is the s...
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits ...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
We verify a conjecture of P. Seymour (Europ. J. Combinatorics 2, p. 289) regarding circuits of a bin...
AbstractLet G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear sys...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
The τ=2 Conjecture, the Replication Conjecture and the f-Flowing Conjecture, and the classification ...
Given a graph G = (V; E), the metric polytope S(G) is defined by the inequalities x(F ) \Gamma x(C n...
Let G = (V,E) be a graph. The matching polytope of G, denoted by P(G), is the convex hull of the inc...
Given a graph G = (V, E) and an integer k >= 1, the graph H = (V, F), where F is a family of elem...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...