AbstractLet 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 L be a binary clutter on E and let d ≥ 2 be an integer. We prove that all the vertices of the polytope {x ∈ RE+ | x(C) ≥ 1 for C ∈ L} ∩ {x | a ≤ x ≤ b} are 1d-integral, for any 1d-integral a, b, if and only if L 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]
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
© The Author(s) 2020 A clutter is k-wise intersecting if every k members have a common element, yet ...
Let F be a binary clutter. We prove that if F is non-ideal, then either F or its blocker b(F) has on...
AbstractLet Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
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 M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
The τ=2 Conjecture, the Replication Conjecture and the f-Flowing Conjecture, and the classification ...
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...
Given a graph G = (V; E), the metric polytope S(G) is defined by the inequalities x(F ) \Gamma x(C n...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
© The Author(s) 2020 A clutter is k-wise intersecting if every k members have a common element, yet ...
Let F be a binary clutter. We prove that if F is non-ideal, then either F or its blocker b(F) has on...
AbstractLet Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting...
Let Q6 denote the port of the dual Fano matroid F*7 and let Q7 denote the clutter consisting of the ...
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 M be a matroid on E ∪ {`}, where ` 6 ∈ E is a distinguished element of M. The `-port of M is the...
Let G be a graph and let A be its cutset-edge incidence matrix. We prove that the linear system frac...
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relat...
The τ=2 Conjecture, the Replication Conjecture and the f-Flowing Conjecture, and the classification ...
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...
Given a graph G = (V; E), the metric polytope S(G) is defined by the inequalities x(F ) \Gamma x(C n...
AbstractWe verify a conjecture regarding circuits of a binary matroid. Acircuit coverof a integer-we...
A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of ba...
© The Author(s) 2020 A clutter is k-wise intersecting if every k members have a common element, yet ...
Let F be a binary clutter. We prove that if F is non-ideal, then either F or its blocker b(F) has on...