## Abstract

Pinchasi and Radoičić [On the number of edges in geometric graphs with no self-intersecting cycle of length 4, in: J. Pach (Ed.), Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342, American Mathematical Society, Providence, RI, 2004] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of the neighbors for every vertex in such a graph and order these lists cyclically according to the order of the emanating edges, then the common elements in any two lists have reversed cyclic order. Building on their work we give an improved estimate on the size of the lists having this property. As a consequence we get that a topological graph on n vertices not containing a self-crossing C_{4} has O(n^{3/2} log n) edges. Our result also implies that n pseudo-circles in the plane can be cut into O(n^{3/2} log n) pseudo-segments, which in turn implies bounds on point-curve incidences and on the complexity of a level of an arrangement of curves.

Original language | English (US) |
---|---|

Pages (from-to) | 675-691 |

Number of pages | 17 |

Journal | Journal of Combinatorial Theory. Series A |

Volume | 113 |

Issue number | 4 |

DOIs | |

State | Published - May 1 2006 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Keywords

- Cyclic order
- Extremal combinatorics
- Pseudocircles
- Topological graphs