Extremal problems for ordered hypergraphs: small patterns and some enumeration (Q1887050): Difference between revisions

This paper (and its predecessor [\textit{M. Klazar}, Eur. J. Comb. 25, 125--140 (2004; Zbl 1031.05071)]) introduces a new (ordered) subhypergraph relationship to generalize several well-studied ``excluded pattern'' type problems, like non-crossing set-partitions, Davenport-Schinzel sequences or pattern avoidance in permutations. A full survey is given for ``small'' excluded hypergraphs together with other ``basic'' extremal problems (like there are no \(k\) pairwise independent edges). Furthermore enumerations for non-order-isomorphic hypergraphs are given.