Normality of k-matching polytopes of bipartite graphs

DOI10.15446/RECOLMA.V57N2.115853zbMATH Open1544.05085MaRDI QIDQ6580438FDOQ6580438

Authors: Juan Camilo Torres 

Publication date: 29 July 2024

Published in: Revista Colombiana de Matemáticas (Search for Journal in Brave)

Recommendations

• The \(k\)-assignment polytope
• Fractional perfect \(b\)-matching polytopes. I: General theory
• Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
• On perfect \(k\)-matchings
• A characterization of PM-compact bipartite and near-bipartite graphs

zbMATH Keywords

bipartite graphsmatchingsnormal polytopesmatching polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Normality of \(k\)-matching polytopes of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580438)