On the maximum number of edges in topologlcal graphs with no four pairwise crossing edges

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that the maximum number of edges in a topological graph on n vertices and with no four pairwise crossing edges is O(n).

Original languageEnglish
Title of host publicationProceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
Pages259-260
Number of pages2
StatePublished - 2006
Externally publishedYes
Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
Duration: 5 Jun 20067 Jun 2006

Publication series

NameProceedings of the Annual Symposium on Computational Geometry
Volume2006

Conference

Conference22nd Annual Symposium on Computational Geometry 2006, SCG'06
Country/TerritoryUnited States
CitySedona, AZ
Period5/06/067/06/06

Keywords

  • Extremal graph theory
  • Geometric graphs
  • Pairwise crossing edges
  • Topological graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'On the maximum number of edges in topologlcal graphs with no four pairwise crossing edges'. Together they form a unique fingerprint.

Cite this