Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Klazar, Martin
The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:120481 
@article{01482107,
     title = {Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {7},
     year = {2000},
     zbl = {0944.05002},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01482107}
}

Klazar, Martin. Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.. The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000) . http://gdmltest.u-ga.fr/item/01482107/