Extremal problems for ordered hypergraphs: small patterns and some enumeration

Abstrakt

We prove several extremal and enumerative results for hypergraphs with ordered vertex sets and derive for them an identity related to Dobinski's formula for Bell numbers.