A linear programming construction of fully optimal bases in graphs and hyperplane arrangements

DOI10.1016/J.ENDM.2009.07.050MaRDI QIDQ2851480zbMATH OpenOpenAlexFDO

Authors Emeric Gioan, Michel Las Vergnas

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.050

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Linear programming (90C05)

Recommendations

• Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
• The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region
• Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
• Active orders for matroid bases
• The active bijection for graphs

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• Activity preserving bijections between spanning trees and orientations in graphs
• Acyclic orientations of graphs
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
• scientific article; zbMATH DE number 3885920 (Why is no real title available?)
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
• The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region

Cited in

(8)

• The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region
• Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids
• Degenerate optimal basis graphs in linear programming
• The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
• Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
• scientific article; zbMATH DE number 1161294 (Why is no real title available?)
• Computing the fully optimal spanning tree of an ordered bipolar directed graph
• The active bijection for graphs

This page was built for publication: A linear programming construction of fully optimal bases in graphs and hyperplane arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851480)