{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:23Z","timestamp":1753893863138,"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>For graphs $F$ and $G$ an $F$-matching in $G$ is a subgraph of $G$ consisting of pairwise vertex disjoint copies of $F$. The number of $F$-matchings in $G$ is denoted by $s(F,G)$. We show that for every fixed positive integer $m$ and every fixed tree $F$, the probability that $s(F,\\mathcal{T}_n) \\equiv 0 \\pmod{m}$, where $\\mathcal{T}_n$ is a random labeled tree with $n$ vertices, tends to one exponentially fast as $n$ grows to infinity. A similar result is proven for induced $F$-matchings. As a very special special case this implies that the number of independent sets in a random labeled tree is almost surely a zero residue. A recent result of Wagner shows that this is the case for random unlabeled trees as well.<\/jats:p>","DOI":"10.37236\/517","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:56:35Z","timestamp":1578714995000},"source":"Crossref","is-referenced-by-count":3,"title":["The Number of $f$-Matchings in Almost Every Tree is a Zero Residue"],"prefix":"10.37236","volume":"18","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simi","family":"Haber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,2,14]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p30\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p30\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:17:21Z","timestamp":1579303041000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,14]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/517","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,2,14]]},"article-number":"P30"}}