Extremal problems for ordered hypergraphs: small patterns and some enumeration

Authors:
Martin Klazar
Affiliations:
Department of Applied Mathematics (KAM), Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměsti 25, Praha 118 00, Czech Republic
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 7
Cited 0

Asymptotic enumeration methods

Handbook of combinatorics (vol. 2)
Analytic combinatorics of non-crossing configurations

Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Noncrossing partitions

Discrete Mathematics
The patterns of permutations

Discrete Mathematics - Kleitman and combinatorics: a celebration
A bijective proof of an identity for noncrossing graphs

Discrete Mathematics
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences

European Journal of Combinatorics
Excluded permutation matrices and the Stanley-Wilf conjecture

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.04

Visualization

Abstract

Functions exe(F,n) and exi(F,n) count edges and vertex-edge incidences in extremal n-vertex hypergraphs avoiding, in the ordered sense, a hypergraph F. We determine them exactly for F consisting of distinct singleton edges and give a survey of exact results for the 55 hypergraphs F with at most four incidences. In the enumerative part we give formulae and recurrences for the numbers of hypergraphs with n incidences. We find rough asymptotics of these numbers and derive identities analogous to Dobinski's formula for Bell numbers.