Extremal problems for ordered hypergraphs: small patterns and some enumeration (Q1887050): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: math/0305048 / rank | |||
Normal rank |
Revision as of 23:38, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extremal problems for ordered hypergraphs: small patterns and some enumeration |
scientific article |
Statements
Extremal problems for ordered hypergraphs: small patterns and some enumeration (English)
0 references
23 November 2004
0 references
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.
0 references
hypergraph
0 references
extremal problem
0 references
Davenport-Schinzel sequences
0 references
Bell number
0 references