Crossing stars in topological graphs

Gábor Tardos, Géza Tóth

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Let G be a graph without loops or multiple edges drawn in the plane. It is shown that, for any k, if G has at least Ckn edges and n vertices, then it contains three sets of k edges, such that every edge in any of the sets crosses all edges in the other two sets. Furthermore, two of the three sets can be chosen such that all k edges in the set have a common vertex.

Original languageEnglish
Title of host publicationDiscrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers
Pages184-197
Number of pages14
DOIs
Publication statusPublished - Dec 1 2005
EventJapanese Conference on Discrete and Computational Geometry, JCDCG 2004 - Tokyo, Japan
Duration: Oct 8 2004Oct 11 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3742 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherJapanese Conference on Discrete and Computational Geometry, JCDCG 2004
CountryJapan
CityTokyo
Period10/8/0410/11/04

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tardos, G., & Tóth, G. (2005). Crossing stars in topological graphs. In Discrete and Computational Geometry - Japanese Conference, JCDCG 2004, Revised Selected Papers (pp. 184-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3742 LNCS). https://doi.org/10.1007/11589440_19