The number of perfect matchings in a hypercube

DOI10.1016/0893-9659(88)90173-5zbMath0626.05043OpenAlexW2076075293MaRDI QIDQ580373

Niall Graham, Frank Harary

Publication date: 1988

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(88)90173-5

zbMATH Keywords

hypercube1-factorperfect matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Divisible design graphs with parameters \((4n,n+2,n-2,2,4,n)\) and \((4n,3n-2,3n-6,2n-2,4,n)\) ⋮ Enumerating perfect matchings in \(n\)-cubes ⋮ Characteristic polynomials, spectral-based Riemann-zeta functions and entropy indices of \(n\)-dimensional hypercubes ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Closed formulas for the number of small paths, independent sets and matchings in fullerenes ⋮ Optimal permutation routing for low-dimensional hypercubes ⋮ Complexes of discrete Morse functions

Cites Work

• Parallel concepts in graph theory
• The statistics of dimers on a lattice
• Lattice Statistics-A Review and an Exact Isotherm for a Plane Lattice Gas

This page was built for publication: The number of perfect matchings in a hypercube