An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. This generalizes both matchings and induced matchings as matchings are $1$-matchings and induced matchings are $2$-matchings. In this paper, we study the minimum and maximum number of $r$-matchings in a tree with fixed order.
@article{10_37236_6681,
author = {Dong Yeap Kang and Jaehoon Kim and Younjin Kim and Hiu-Fai Law},
title = {On the number of \(r\)-matchings in a tree},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {1},
doi = {10.37236/6681},
zbl = {1355.05200},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6681/}
}
TY - JOUR
AU - Dong Yeap Kang
AU - Jaehoon Kim
AU - Younjin Kim
AU - Hiu-Fai Law
TI - On the number of \(r\)-matchings in a tree
JO - The electronic journal of combinatorics
PY - 2017
VL - 24
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/6681/
DO - 10.37236/6681
ID - 10_37236_6681
ER -
%0 Journal Article
%A Dong Yeap Kang
%A Jaehoon Kim
%A Younjin Kim
%A Hiu-Fai Law
%T On the number of \(r\)-matchings in a tree
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6681/
%R 10.37236/6681
%F 10_37236_6681
Dong Yeap Kang; Jaehoon Kim; Younjin Kim; Hiu-Fai Law. On the number of \(r\)-matchings in a tree. The electronic journal of combinatorics, Tome 24 (2017) no. 1. doi: 10.37236/6681
