A linear upper bound in extremal theory of sequences

DOI10.1016/0097-3165(94)90115-5zbMath0808.05096OpenAlexW2045064728MaRDI QIDQ1337178

Martin Klazar

Publication date: 30 October 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90115-5

zbMATH Keywords

Davenport-Schinzel sequences

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Extremal combinatorics (05D99)

Related Items (3)

Generalized Davenport-Schinzel sequences ⋮ Extremal functions for sequences ⋮ Extremal problems for colored trees and Davenport-Schinzel sequences

Cites Work

• Unnamed Item
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Generalized Davenport-Schinzel sequences with linear upper bound
• On a problem of Davenport and Schinzel
• A combinatorial problem connected with differential equations II

This page was built for publication: A linear upper bound in extremal theory of sequences