Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences

DOI10.1016/j.ejc.2003.05.001zbMath1031.05071arXivmath/0305037OpenAlexW1971975179MaRDI QIDQ1422400

Martin Klazar

Publication date: 14 February 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal functionsAckermann functionforests

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Special sequences and polynomials (11B83)

Related Items (6)

Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ Interval Minors of Complete Bipartite Graphs ⋮ Extensions of the linear bound in the Füredi-Hajnal conjecture ⋮ Excluded permutation matrices and the Stanley-Wilf conjecture ⋮ Ramsey numbers of ordered graphs ⋮ On 0-1 matrices and small excluded submatrices

Cites Work

• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Davenport-Schinzel theory of matrices
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• The maximum number of unit distances in a convex \(n\)-gon
• Extremal problems for ordered hypergraphs: small patterns and some enumeration
• Graph Theory and Probability
• A Combinatorial Problem Connected with Differential Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences