A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements

DOI10.1016/j.endm.2009.07.050zbMath1273.05030OpenAlexW1973419485MaRDI QIDQ2851480

Michel Las Vergnas, Emeric Gioan

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

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

Related Items (2)

Computing the fully optimal spanning tree of an ordered bipolar directed graph ⋮ The active bijection for graphs

Cites Work

• Unnamed Item
• The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region
• The active bijection between regions and simplices in supersolvable arrangements of hyperplanes
• Acyclic orientations of graphs
• Activity preserving bijections between spanning trees and orientations in graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements