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

Alon, Noga, Haber, Simi, and Krivelevich, Michael. "The number of -matchings in almost every tree is a zero residue.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P30, 10 p., electronic only-Research Paper P30, 10 p., electronic only. <http://eudml.org/doc/227829>.

@article{Alon2011,
author = {Alon, Noga, Haber, Simi, Krivelevich, Michael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper P30, 10 p., electronic only-Research Paper P30, 10 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The number of -matchings in almost every tree is a zero residue.},
url = {http://eudml.org/doc/227829},
volume = {18},
year = {2011},
}

TY - JOUR
AU - Alon, Noga
AU - Haber, Simi
AU - Krivelevich, Michael
TI - The number of -matchings in almost every tree is a zero residue.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P30, 10 p., electronic only
EP - Research Paper P30, 10 p., electronic only
LA - eng
UR - http://eudml.org/doc/227829
ER -