Results and open problems in matchings in regular graphs

DOI10.13001/1081-3810.1577zbMath1252.05174arXiv1112.5632OpenAlexW2963066342MaRDI QIDQ3166916

Shmuel Friedland

Publication date: 1 November 2012

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.5632

zbMATH Keywords

permanentsbipartite graphsdoubly stochastic matricesnon-bipartite graphshaffniansmatching polytope of a complete graph

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs ⋮ Results and questions on matchings in abelian groups and vector subspaces of fields ⋮ The extendability of matchings in strongly regular graphs

This page was built for publication: Results and open problems in matchings in regular graphs