Perfect matching and polymatroids

DOI10.1007/S10559-017-9977-8MaRDI QIDQ681726zbMATH OpenOpenAlexFDO

Authors F. A. Sharifov

Publication date 13 February 2018

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-017-9977-8

zbMATH Keywords

perfect matchingextended polymatroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matchings and extended polymatroid
• Perfect matchings of polyomino graphs
• Perfect matchings of generalized polyomino graphs
• Perfect matchings and applications
• On perfect \(k\)-matchings
• Perfect matchings and derangements on graphs
• Perfect matchings in hypergraphs and the Erdős matching conjecture
• On perfect matchings in \(k\)-complexes
• Perfect matchings and perfect powers
• The graph of perfect matching polytope and an extreme problem

Cites work

• Estimating the supply chain efficiency loss when the seller has to estimate the buyer's willingness to pay
• Geometric algorithms and combinatorial optimization
• Matching theory
• Perfect matchings and extended polymatroid
• Perfectly matchable subgraph problem on a bipartite graph

Cited in

(21)

• scientific article; zbMATH DE number 812089 (Why is no real title available?)
• Perfect matching in graphs: an approach via Gröbner basis
• Perfect matchings in the triangular lattice
• New variants of perfect non-crossing matchings
• On matroid parity and matching polytopes
• scientific article; zbMATH DE number 4114689 (Why is no real title available?)
• On the efficiency of Egerváry's perfect matching algorithm
• Perfectly matchable subgraph problem on a bipartite graph
• On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
• A Simple Criterion for a Graph to have a Perfect Matching
• Matching Problems in Polymatroids Without Double Circuits
• The perfectly matchable subgraph polytope of an arbitrary graph
• The perfect matching polytope and solid bricks
• scientific article; zbMATH DE number 4112647 (Why is no real title available?)
• A simple a. s. correct algorithm for deciding if a graph has a perfect matching
• Perfect matchings and extended polymatroid
• Perfect matching on regular polyhedra
• Symmetry-preserving matchings
• Perfect matchings versus odd cuts
• Touching perfect matchings and halving lines
• Low weight perfect matchings

This page was built for publication: Perfect matching and polymatroids

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