The membership problem in jump systems
From MaRDI portal
Publication:1369649
DOI10.1006/JCTB.1997.1744zbMath0884.05028OpenAlexW2026225389MaRDI QIDQ1369649
No author found.
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 pointsjump systemmin-max formulaexchange axiomEdmond matroid intersection theoremTutte's \(f\)-factor theorem
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (17)
Triangle-free 2-matchings and M-concave functions on jump systems ⋮ Optimal general factor problem and jump system intersection ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs ⋮ Matroids—the Engineers’ Revenge ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ A note on M-convex functions on jump systems ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ Polynomials with the half-plane property and matroid theory ⋮ Geometry of jump systems ⋮ A generalization of permanent inequalities and applications in counting and optimization ⋮ Induction of M-convex functions by linking systems ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ Even factors, jump systems, and discrete convexity ⋮ Generalized matroid matching ⋮ Complexity results for minimum sum edge coloring
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
This page was built for publication: The membership problem in jump systems