Geodesic
On the number of \(F\)-matchings in a tree
The electronic journal of combinatorics, Tome 19 (2012) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that for any integers $k,m>0$ and any tree $F$ with at least one edge, there exists a tree whose number of $F$-matchings is congruent to $k$ modulo $m$ as well as an analogous result for induced $F$-matchings. This answers a question of Alon, Haber and Krivelevich (The number of $F$-matchings in almost every tree is a zero residue, Electron. J. Combin. 18 (2011), #P30).
DOI : 10.37236/2052
Classification : 05C70, 05C30, 05C05, 05C60
Mots-clés : random labeled tree 
@article{10_37236_2052,
     author = {Hiu-Fai Law},
     title = {On the number of {\(F\)-matchings} in a tree},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {1},
     doi = {10.37236/2052},
     zbl = {1243.05201},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2052/}
}
TY  - JOUR
AU  - Hiu-Fai Law
TI  - On the number of \(F\)-matchings in a tree
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2052/
DO  - 10.37236/2052
ID  - 10_37236_2052
ER  - 
%0 Journal Article
%A Hiu-Fai Law
%T On the number of \(F\)-matchings in a tree
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2052/
%R 10.37236/2052
%F 10_37236_2052
Hiu-Fai Law. On the number of \(F\)-matchings in a tree. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/2052

Cité par Sources :