On matroid intersection adjacency
From MaRDI portal
(Redirected from On matroid intersection adjacency)
A simple alternative proof for a theorem of \textit{A. Frank} and \textit{É. Tardos} [Math. Program., Ser. B 42, No. 3, 489-563 (1988; Zbl 0665.90073)] on the adjacency of the extreme points in the common base polytope of a pair of matroids is given. The author applies the simultaneous base exchange axiom, independent of the linear inequality description of the polytope due to \textit{J. Edmonds} [Combinat. Struct. Appl., Proc. Calgary Internat. Conf. Combinat. Struct. Appl., Calgary 1969, 69-87 (1970; Zbl 0268.05019)].
Recommendations
- scientific article; zbMATH DE number 4089608
- The intersection of matroids and antimatroids
- scientific article; zbMATH DE number 1929933
- Intersecting matroids by a hyperplane
- The intersection of a matroid and an oriented matroid
- The intersection ring of matroids
- Matching as the Intersection of Matroids
- Adjacency in binary matroids
- On the intersections of circuits and cocircuits in matroids
- On the interplay between graphs and matroids
Cited in
(17)- Matroid tree graphs and interpolation theorems
- On the intersection conjecture for infinite trees of matroids
- Intersection of a partitional and a general infinite matroid
- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- Matroid bases with cardinality constraints on the intersection
- A note on the lattice of 2-matroid-intersections
- On the interplay between graphs and matroids
- scientific article; zbMATH DE number 5888307 (Why is no real title available?)
- Adjacency on polymatroids
- Matching as the Intersection of Matroids
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- scientific article; zbMATH DE number 8667 (Why is no real title available?)
- scientific article; zbMATH DE number 1932376 (Why is no real title available?)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Flip distances between graph orientations
- Inapproximability of shortest paths on perfect matching polytopes
- Inapproximability of shortest paths on perfect matching polytopes
This page was built for publication: On matroid intersection adjacency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957761)
