Extremal problems for ordered (hyper)graphs: applications of Davenport–Schinzel sequences
- 31 January 2004
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 25 (1) , 125-140
- https://doi.org/10.1016/j.ejc.2003.05.001
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Counting Pattern-free Set Partitions II: Noncrossing and Other HypergraphsThe Electronic Journal of Combinatorics, 2000
- Davenport-Schinzel theory of matricesDiscrete Mathematics, 1992
- The maximum number of unit distances in a convex n-gonJournal of Combinatorial Theory, Series A, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959