Polyhedra with the integer Carathéodory property

DOI10.1016/j.jctb.2011.04.004zbMath1252.52009arXiv1004.4552MaRDI QIDQ765190

Guus Regts, Dion C. Gijswijt

Publication date: 19 March 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.4552

zbMATH Keywords

matroid; totally unimodular matrix; integer decomposition; base polytope; Carathéodory

Mathematics Subject Classification ID

52B11: (n)-dimensional polytopes

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Stronger bounds and faster algorithms for packing in generalized kernel systems, A faster algorithm for packing branchings in digraphs, On the toric ideals of matroids of a fixed rank, Box-total dual integrality, box-integrality, and equimodular matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing membership in matroid polyhedra
• An integer analogue of Carathéodory's theorem
• Coflow polyhedra
• Improved bound for the Carathéodory rank of the bases of a matroid
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On greedy bases packing in matroids
• Submodular functions and optimization.
• Path Partitions, Cycle Covers and Integer Decomposition
• A counterexample to an integer analogue of Carathéodory's theorem
• Integral decomposition in polyhedra
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices