Dominance order and graphical partitions
The electronic journal of combinatorics, Tome 11 (2004) no. 1
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number $g(n)$ of graphical partitions of weight $n$ for up to $n>900$.
@article{10_37236_1845,
author = {Axel Kohnert},
title = {Dominance order and graphical partitions},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {1},
doi = {10.37236/1845},
zbl = {1058.05005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1845/}
}
Axel Kohnert. Dominance order and graphical partitions. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1845
Cité par Sources :