On the number of \(r\)-matchings in a tree

zbMath1355.05200arXiv1409.7795MaRDI QIDQ510338

Dong Yeap Kang, Hiu-Fai Law, Younjin Kim, Jae-Hoon Kim

Publication date: 17 February 2017

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

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

zbMATH Keywords

matchingindependent set

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of \(F\)-matchings in a tree
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the number of matchings of a tree
• On the number of graphs without 4-cycles
• Independent sets in regular graphs and sum-free subsets of finite groups
• The maximum number of complete subgraphs in a graph with given maximum degree
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• The Asymptotic Number of Lattices
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• Sum-free sets in Abelian groups.

This page was built for publication: On the number of \(r\)-matchings in a tree