Polyhedra with the integer Carathéodory property

DOI10.1016/j.jctb.2011.04.004zbMath1252.52009arXiv1004.4552OpenAlexW2133236115MaRDI 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

matroidtotally unimodular matrixinteger decompositionbase polytopeCarathéodory

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

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

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