Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
From MaRDI portal
(Redirected from Publication:1433002)
Recommendations
- Bases-cobases graphs and polytopes of matroids
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- scientific article; zbMATH DE number 4112602
- The optimal base of a matroid with three-type constraints
- Oriented rank three matroids and projective planes
- On Rota's problem about n bases in a rank n matroid
- A characterization of the bases of line-splitting matroids
- A linear programming construction of fully optimal bases in graphs and hyperplane arrangements
- On the number of bases of almost all matroids
- On some properties of base-matroids
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- Activity preserving bijections between spanning trees and orientations in graphs
- Acyclic and totally cyclic orientations of combinatorial geometries
- Acyclic orientations of graphs
- Convexity in oriented matroids
- External and internal elements of a matroid basis
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- scientific article; zbMATH DE number 3885920 (Why is no real title available?)
- scientific article; zbMATH DE number 3869362 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 3475463 (Why is no real title available?)
- scientific article; zbMATH DE number 3608715 (Why is no real title available?)
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Oriented Matroids
- The Tutte polynomial
Cited in
(12)- The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region
- External and internal elements of a matroid basis
- Mutation polynomials and oriented matroids
- Topological bijections for oriented matroids
- The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
- The odd--even invariant of an oriented matroid
- Activity preserving bijections between spanning trees and orientations in graphs
- A linear programming construction of fully optimal bases in graphs and hyperplane arrangements
- Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
- Computing the fully optimal spanning tree of an ordered bipolar directed graph
- The active bijection for graphs
- Extension-lifting bijections for oriented matroids
This page was built for publication: Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433002)