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

  title={Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences},
  author={Martin Klazar},
  journal={Eur. J. Comb.},
We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generally applicable theorem, the n log n upper bound on the ordered graph extremal function of F = ({1, 3}, {1, 5}, {2, 3}, {2, 4}) due to Füredi to the n(log n)2(log log n)3 upper bound in the hypergraph case. We use Davenport–Schinzel sequences to derive almost linear upper bounds in terms of the inverse Ackermann function… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

Extremal problems for ordered hypergraphs : small configurations and some enumeration , in preparation

  • P. K. Agarwal
  • 2002

Applications of the set-pair method in extremal problems, II

  • Zs. Tuza
  • Combinatorics, Paul Erdős is Eighty,
  • 1996
2 Excerpts

Extremal graph theory

  • B. Bollobás
  • Handbook of Combinatorics,
  • 1995
3 Excerpts

Similar Papers

Loading similar papers…