Extremal problems for ordered hypergraphs: small patterns and some enumeration

DOI10.1016/j.dam.2004.02.004zbMath1054.05072arXivmath/0305048OpenAlexW2005446908MaRDI QIDQ1887050

Martin Klazar

Publication date: 23 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0305048

zbMATH Keywords

hypergraphBell numberextremal problemDavenport-Schinzel sequences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences ⋮ Ramsey numbers of ordered graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• A simplified proof of the partition formula
• Analytic combinatorics of non-crossing configurations
• Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• The patterns of permutations
• A bijective proof of an identity for noncrossing graphs
• Extremal problems for ordered hypergraphs: small patterns and some enumeration
• Noncrossing partitions
• Minimal covers of finite sets
• Iterated Binomial Coefficients
• THE ENUMERATION OF A FAMILY OF LADDER GRAPHS PART II: SCHRODER AND SUPERCONNECTIVE RELATIONS
• Covers of a Finite Set
• Analytic Number Theory