AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math. Programming 42 (1988) 489) on adjacency of extreme points in the common base polytope of a pair of matroids. The new proof relies merely on the simultaneous base exchange axiom, independent of the linear inequality description of the polytope due to Edmonds (Guy et al. (Eds.), Combinatorial Structures and Their Applications, Gordon and Breach, London, 1970, p. 69)
AbstractA characterization of the maximum-cardinality common independent sets of two matroids via an...
AbstractWe define the concept of unique exchange on a sequence (X1,…, Xm) of bases of a matroid M as...
AbstractWe present an elementary proof of the well-known theorem of Edmonds and Fulkerson that a mat...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractA characterization of the maximum-cardinality common independent sets of two matroids via an...
In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on th...
In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on th...
AbstractM1=(E,F1) and M2=(E,F2) are two simple matroids on the same set E. We assume that M1 and M2 ...
The matroid parity (MP) problem is a powerful (and NP-hard) extension of the matching problem. Where...
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the com...
AbstractTwo simple proofs are given to an earlier partial result about an extremal set theoretic con...
AbstractΔ-matroids are set systems which arise, e.g., in the study of greedy algorithms. Similarly t...
AbstractWe define the concept of unique exchange on a sequence (X1,…, Xm) of bases of a matroid M as...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractIt has been conjectured that, asymptotically, almost all matroids are sparse paving matroids...
AbstractA characterization of the maximum-cardinality common independent sets of two matroids via an...
AbstractWe define the concept of unique exchange on a sequence (X1,…, Xm) of bases of a matroid M as...
AbstractWe present an elementary proof of the well-known theorem of Edmonds and Fulkerson that a mat...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractA characterization of the maximum-cardinality common independent sets of two matroids via an...
In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on th...
In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on th...
AbstractM1=(E,F1) and M2=(E,F2) are two simple matroids on the same set E. We assume that M1 and M2 ...
The matroid parity (MP) problem is a powerful (and NP-hard) extension of the matching problem. Where...
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the com...
AbstractTwo simple proofs are given to an earlier partial result about an extremal set theoretic con...
AbstractΔ-matroids are set systems which arise, e.g., in the study of greedy algorithms. Similarly t...
AbstractWe define the concept of unique exchange on a sequence (X1,…, Xm) of bases of a matroid M as...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
AbstractIt has been conjectured that, asymptotically, almost all matroids are sparse paving matroids...
AbstractA characterization of the maximum-cardinality common independent sets of two matroids via an...
AbstractWe define the concept of unique exchange on a sequence (X1,…, Xm) of bases of a matroid M as...
AbstractWe present an elementary proof of the well-known theorem of Edmonds and Fulkerson that a mat...