{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:57Z","timestamp":1753893837484,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/6681","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:25:01Z","timestamp":1578684301000},"source":"Crossref","is-referenced-by-count":1,"title":["On the Number of $r$-Matchings in a Tree"],"prefix":"10.37236","volume":"24","author":[{"given":"Dong Yeap","family":"Kang","sequence":"first","affiliation":[]},{"given":"Jaehoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Younjin","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Hiu-Fai","family":"Law","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,2,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p24\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p24\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:05:33Z","timestamp":1579237533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/6681","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,3]]},"article-number":"P1.24"}}