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

European Journal of Combinatorics

Volumn 25, Issue 1, 2004, Pages 125-140

  Klazar, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348159790     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2003.05.001     Document Type: Article

References (22)

1. Agarwal P.K. Sharir M. Davenport-Schinzel sequences and their geometric applications In Sacks J.-R. Urrutia J. (Eds.), Handbook of Computational Geometry 2000 1-47 Elsevier Amsterdam
2. Agarwal P.K. Sharir M. Shor P. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences J. Combin. Theory Ser. A 52 1989 228-274
3. Bollobás B. Extremal Graph Theory 1978 Academic Press London
4. Bollobás B. Extremal graph theory In Graham R.L. Grötschel M. Lovász L. (Eds.), Handbook of Combinatorics vol. 2 1995 1231-1292 Elsevier Amsterdam
5. Bollobás B. Modern Graph Theory 1998 Springer Berlin
6. Brass P. Károlyi G. Valtr P. A Turán-type extremal theory of convex geometric graphs In Aronov B. et al. (Eds.), Discrete and Computational Geometry-The Goodman-Pollack Festschrift 2003 275-300 Springer Verlag Berlin
7. Davenport H. Schinzel A. A combinatorial problem connected with differential equations Amer. J. Math. 87 1965 684-694
8. Erdos P. Graph theory and probability Canad. J. Math. 11 1959 34-38
9. Frankl P. Extremal set systems In Graham R.L. Grötschel M. Lovász L. (Eds.), Handbook of Combinatorics vol. 2 1995 1293-1329 Elsevier Amsterdam
10. Füredi Z. The maximum number of unit distances in a convex n-gon J. Combin. Theory Ser. A 55 1990 316-320
11. Füredi Z. Turán type problems In Keedwell A.D. (Ed.), Surveys in Combinatorics, 1991 1991 253-300 Cambridge University Press Cambridge, UK
12. Füredi Z. Hajnal P. Davenport-Schinzel theory of matrices Discrete Math. 103 1992 233-251
13. Hart S. Sharir M. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes Combinatorica 6 1986 151-177
14. Klazar M. A general upper bound in extremal theory of sequences Comment. Math. Univ. Carolin. 33 1992 737-746
15. Klazar M. Counting pattern-free set partitions II. Noncrossing and other hypergraphs Electron. J. Combin. 7 2000 R34 25 pages
16. M. Klazar, Extremal problems (and a bit of enumeration) for hypergraphs with linearly ordered vertex sets, ITI Series, Technical Report 2001-021, 40 pages
17. Klazar M. Generalized Davenport-Schinzel sequences: results, problems, and applications Integers 2 2002 A11 39 pages
18. M. Klazar, Extremal problems for ordered hypergraphs: small configurations and some enumeration (submitted)
19. Sharir M. Agarwal P.K. Davenport-Schinzel Sequences and their Geometric Applications 1995 Cambridge University Press Cambridge, UK
20. Tuza Zs. Applications of the set-pair method in extremal hypergraph theory In Frankl P. et al (Eds.), Extremal Problems for Finite Sets 1994 479-514 János Bolyai Mathematical Society Budapest
21. Tuza Zs. Applications of the set-pair method in extremal problems, II In Miklós D. et al (Eds.), Combinatorics, Paul Erdos is Eighty vol. 2 1996 459-490 János Bolyai Mathematical Society Budapest
22. P. Valtr, Generalizations of Davenport-Schinzel sequences, in: R.L. Graham et al. (Eds.), Contemporary Trends in Discrete Mathematics, Štiřín Castle 1997 (Czech Republic), American Mathematical Society, Providence, RI, 1999, pp. 349-389.