Name
Abstract | ||
|---|---|---|
Let G be a multigraph with n vertices and epsilon > 4n edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and Toth [5] extended the Crossing Lemma of Ajtai et al. [1] and Leighton [3] by showing that if no two adjacent edges cross and every pair of nonadjacent edges cross at most once, then the number of edge crossings in G is at least alpha epsilon(3)/n(2), for a suitable constant alpha > 0. The situation turns out to be quite different if nonparallel edges are allowed to cross any number of times. It is proved that in this case the number of crossings in G is at least alpha epsilon(2.5)/n(1.5). The order of magnitude of this bound cannot be improved. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-04414-5_17 | GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018 |
DocType | Volume | ISSN |
Conference | 11282 | 0302-9743 |
Citations | PageRank | References |
1 | 0.40 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Kaufmann | 1 | 1224 | 107.33 |
| János Pach | 2 | 2366 | 292.28 |
| Géza Tóth | 3 | 581 | 55.60 |
| torsten ueckerdt | 4 | 141 | 26.26 |