Extremal problems for ordered hypergraphs: small patterns and some enumeration

Details Extremal problems for ordered hypergraphs: small patterns and some enumeration Extremal problems for ordered hypergraphs: small patterns and some enumeration

2003-05-02

arxiv.org/abs/math/0305048v1

Mathematics

Combinatorics

22 pages, submitted to Discrete Applied Mathematics

Scientific paper

We investigate extremal functions ex_e(F,n) and ex_i(F,n) counting maximum numbers of edges and maximum numbers of vertex-edge incidences in simple hypergraphs H which have n vertices and do not contain a fixed hypergraph F; the containment respects linear orderings of vertices. We determine both functions exactly if F has only distinct singleton edges or if F is one of the 55 hypergraphs with at most four incidences (we give proofs only for six cases). We prove some exact formulae and recurrences for the numbers of hypergraphs, simple and all, with n incidences and derive rough logarithmic asymptotics of these numbers. Identities analogous to Dobinski's formula for Bell numbers are given.

Affiliated with

Also associated with

No associations

Rating

Extremal problems for ordered hypergraphs: small patterns and some enumeration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extremal problems for ordered hypergraphs: small patterns and some enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extremal problems for ordered hypergraphs: small patterns and some enumeration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703651