Unavoidable Configurations in Complete Topological GraphsPach, János and Tóth, Géza (2001) Unavoidable Configurations in Complete Topological Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 328337(Official URL: http://dx.doi.org/10.1007/3540445412_31). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540445412_31
AbstractA topological graph is a graph drawn in the plane so that its vertices are represented by points, and its edges are represented by Jordan curves connecting the corresponding points, with the property that any two curves have at most one point in common. We define two canonical classes of topological complete graphs, and prove that every topological complete graph with n vertices has a canonical subgraph of size at least $c\log\log n$, which belongs to one of these classes. We also show that every complete topological graph with n vertices has a noncrossing subgraph isomorphic to any fixed tree with at most $c\log^{1/6}n$ vertices.
Actions (login required)
