Counting pattern-free set partitions. II: Noncrossing and other hypergraphs

Abstrakt

The enumerative investigation is extended from set partitions (the previous article) to hypergraphs. Extremal results are obtained as well, by means of Davenport-Schinzel sequences.