Enumerating perfect matchings in n-cubes

DOI10.1007/S11083-012-9279-8MaRDI QIDQ382880zbMATH OpenOpenAlexWikidataFDO

Authors Patric R. J. Östergård, Ville H. Pettersson

Publication date 22 November 2013

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-012-9279-8

zbMATH Keywords

dynamic programmingenumerationperfect matchingN-cube

Mathematics Subject Classification ID

Dynamic programming (90C39) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The number of perfect matchings in a hypercube
• The enumeration of perfect matchings in two types of graphs
• scientific article; zbMATH DE number 5952364
• scientific article; zbMATH DE number 888853
• On special perfect matchings in a Boolean cube

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 1104328 (Why is no real title available?)
• scientific article; zbMATH DE number 1156633 (Why is no real title available?)
• scientific article; zbMATH DE number 2081005 (Why is no real title available?)
• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• Classification of Binary Constant Weight Codes
• Counting Hamiltonian cycles in bipartite graphs
• Finding all the perfect matchings in bipartite graphs
• Matching theory
• On the number of Latin squares
• The complexity of computing the permanent
• The number of Latin squares of order 11
• The number of perfect matchings in a hypercube
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cited in

(8)

• Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• Characteristic polynomials, spectral-based Riemann-zeta functions and entropy indices of \(n\)-dimensional hypercubes
• Maximum matchings in the \(n\)-dimensional cube
• Enumerating Hamiltonian cycles
• Exact Ramsey numbers of odd cycles via nonlinear optimisation
• The number of perfect matchings in a hypercube
• Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes

Describes a project that uses

Uses Software

• libexact

This page was built for publication: Enumerating perfect matchings in \(n\)-cubes

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