The membership problem in jump systems
From MaRDI portal
Publication:1369649
DOI10.1006/jctb.1997.1744zbMath0884.05028MaRDI QIDQ1369649
Publication date: 18 March 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1744
lattice points; jump system; min-max formula; exchange axiom; Edmond matroid intersection theorem; Tutte's \(f\)-factor theorem
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Induction of M-convex functions by linking systems, Complexity results for minimum sum edge coloring, Homogeneous multivariate polynomials with the half-plane property, Polynomials with the half-plane property and matroid theory, Geometry of jump systems, Even factors, jump systems, and discrete convexity
Cites Work
- Unnamed Item
- General factors of graphs
- Matching theory
- Generalized polymatroids and submodular flows
- Matroid matching and some applications
- \(b\)-matching degree-sequence polyhedra
- Submodular functions and optimization
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM
- A Min--Max Theorem for Bisubmodular Polyhedra
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Least Majorized Elements and Generalized Polymatroids
- Subgraphs with prescribed valencies
- The factorization of graphs. II
- The Factors of Graphs