Extremal problems in ordered graphs

@article{Weidert2009ExtremalPI,
  title={Extremal problems in ordered graphs},
  author={Craig Weidert},
  journal={CoRR},
  year={2009},
  volume={abs/0907.2479}
}
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered graph as a subgraph. In particular, we take a step toward confirming a conjecture of Pach and Tardos [12] regarding the number of edges allowed when the forbidden pattern is a tree by establishing an upper bound for a particular ordered graph for which existing… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Forbidden paths and cycles in ordered graphs and matrices, Israel

  • János Pach, Gábor Tardos
  • Journal of Mathematics
  • 2006
Highly Influential
12 Excerpts

Regulare Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Martin-Luther-Univ

  • Paul Erdős, H. Sachs
  • Halle-Wittenberg, Math.-Naturwiss. Reihe
  • 1963
Highly Influential
2 Excerpts

A Turán-type Extremal Theory of Convex Geometric Graphs, Discrete and Computational Geometry–The Goodman-Pollack Festschrift

  • Peter Brass, Gyula Károlyi, Pavel Valtr
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…