The number of F-matchings in almost every tree is a zero residue

Noga Alon, Simi Haber, Michael Krivelevich

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 e…