Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R34, 25 p.-Research paper R34, 25 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKlazar, Martin. "Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R34, 25 p.-Research paper R34, 25 p.. <http://eudml.org/doc/120481>.
@article{Klazar2000,
author = {Klazar, Martin},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {permutation; hypergraph; Stanley-Wilf conjecture; Davenport-Schinzel sequences},
language = {eng},
number = {1},
pages = {Research paper R34, 25 p.-Research paper R34, 25 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.},
url = {http://eudml.org/doc/120481},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Klazar, Martin
TI - Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R34, 25 p.
EP - Research paper R34, 25 p.
LA - eng
KW - permutation; hypergraph; Stanley-Wilf conjecture; Davenport-Schinzel sequences
UR - http://eudml.org/doc/120481
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.