Crossing stars in topological graphs

G. Tardos, Géza Tóth

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

4 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages184-197
Number of pages14
Volume3742 LNCS
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Topological Graph
Stars
Star
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Tardos, G., & Tóth, G. (2005). Crossing stars in topological graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3742 LNCS, 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

Crossing stars in topological graphs. / Tardos, G.; Tóth, Géza.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3742 LNCS 2005. p. 184-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3742 LNCS).

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

Tardos, G & Tóth, G 2005, Crossing stars in topological graphs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3742 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3742 LNCS, pp. 184-197, Japanese Conference on Discrete and Computational Geometry, JCDCG 2004, Tokyo, Japan, 10/8/04. https://doi.org/10.1007/11589440_19
Tardos G, Tóth G. Crossing stars in topological graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3742 LNCS. 2005. p. 184-197. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11589440_19
Tardos, G. ; Tóth, Géza. / Crossing stars in topological graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3742 LNCS 2005. pp. 184-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e99fe5f446814686a31585826bc2e046,
title = "Crossing stars in topological graphs",
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.",
author = "G. Tardos and G{\'e}za T{\'o}th",
year = "2005",
doi = "10.1007/11589440_19",
language = "English",
isbn = "3540304673",
volume = "3742 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "184--197",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Crossing stars in topological graphs

AU - Tardos, G.

AU - Tóth, Géza

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646508782&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646508782&partnerID=8YFLogxK

U2 - 10.1007/11589440_19

DO - 10.1007/11589440_19

M3 - Conference contribution

SN - 3540304673

SN - 9783540304678

VL - 3742 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 184

EP - 197

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -