Enumeration of matchings in complete \(q\)-ary trees

DOI10.1134/S0001434622030075zbMath1487.05210OpenAlexW4224881186MaRDI QIDQ2133819

N. A. Kuz'min, Dmitriy S. Malyshev

Publication date: 5 May 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622030075

zbMATH Keywords

matchinglimit theoremcomplete \(q\)-ary treeindependent matching

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of maximal independent sets in complete \(q\)-ary trees
• The statistics of dimers on a lattice
• The Number of Independent Sets in a Grid Graph