New bounds on crossing numbers

Janos Pach, Joel Spencer, Geza Toth

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. Denote by κ(n, e) the minimum of cr(G) taken over all graphs with n vertices and at least e edges. We prove a conjecture of P. Erdos and R. Guy by showing that κ(n, e)n 2/e 3 tends to a positive constant as n→∞ and n≪e≪n 2. Similar results hold for graph drawings on any other surface of fixed genus. We prove better bounds for graphs satisfying some monotone properties. In particular, we show that if G is a graph with n vertices and e≥4n edges, which does not contain a cycle of length four (resp. six), then its crossing number is at least ce 4/n 3 (resp. ce 5/n 4), where c>0 is a suitable constant. These results cannot be improved, apart from the value of the constant. This settles a question of M. Simonovits.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherACM
Pages124-133
Number of pages10
StatePublished - 1999
EventProceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA
Duration: Jun 13 1999Jun 16 1999

Other

OtherProceedings of the 1999 15th Annual Symposium on Computational Geometry
CityMiami Beach, FL, USA
Period6/13/996/16/99

Fingerprint

Crossing number
Graph in graph theory
Graph Drawing
Monotone
Genus
Tend
Denote
Cycle

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Pach, J., Spencer, J., & Toth, G. (1999). New bounds on crossing numbers. In Proceedings of the Annual Symposium on Computational Geometry (pp. 124-133). ACM.

New bounds on crossing numbers. / Pach, Janos; Spencer, Joel; Toth, Geza.

Proceedings of the Annual Symposium on Computational Geometry. ACM, 1999. p. 124-133.

Research output: Chapter in Book/Report/Conference proceedingChapter

Pach, J, Spencer, J & Toth, G 1999, New bounds on crossing numbers. in Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 124-133, Proceedings of the 1999 15th Annual Symposium on Computational Geometry, Miami Beach, FL, USA, 6/13/99.
Pach J, Spencer J, Toth G. New bounds on crossing numbers. In Proceedings of the Annual Symposium on Computational Geometry. ACM. 1999. p. 124-133
Pach, Janos ; Spencer, Joel ; Toth, Geza. / New bounds on crossing numbers. Proceedings of the Annual Symposium on Computational Geometry. ACM, 1999. pp. 124-133
@inbook{d1daab65cad349468b5a68ce7b371ba2,
title = "New bounds on crossing numbers",
abstract = "The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. Denote by κ(n, e) the minimum of cr(G) taken over all graphs with n vertices and at least e edges. We prove a conjecture of P. Erdos and R. Guy by showing that κ(n, e)n 2/e 3 tends to a positive constant as n→∞ and n≪e≪n 2. Similar results hold for graph drawings on any other surface of fixed genus. We prove better bounds for graphs satisfying some monotone properties. In particular, we show that if G is a graph with n vertices and e≥4n edges, which does not contain a cycle of length four (resp. six), then its crossing number is at least ce 4/n 3 (resp. ce 5/n 4), where c>0 is a suitable constant. These results cannot be improved, apart from the value of the constant. This settles a question of M. Simonovits.",
author = "Janos Pach and Joel Spencer and Geza Toth",
year = "1999",
language = "English (US)",
pages = "124--133",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "ACM",

}

TY - CHAP

T1 - New bounds on crossing numbers

AU - Pach, Janos

AU - Spencer, Joel

AU - Toth, Geza

PY - 1999

Y1 - 1999

N2 - The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. Denote by κ(n, e) the minimum of cr(G) taken over all graphs with n vertices and at least e edges. We prove a conjecture of P. Erdos and R. Guy by showing that κ(n, e)n 2/e 3 tends to a positive constant as n→∞ and n≪e≪n 2. Similar results hold for graph drawings on any other surface of fixed genus. We prove better bounds for graphs satisfying some monotone properties. In particular, we show that if G is a graph with n vertices and e≥4n edges, which does not contain a cycle of length four (resp. six), then its crossing number is at least ce 4/n 3 (resp. ce 5/n 4), where c>0 is a suitable constant. These results cannot be improved, apart from the value of the constant. This settles a question of M. Simonovits.

AB - The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. Denote by κ(n, e) the minimum of cr(G) taken over all graphs with n vertices and at least e edges. We prove a conjecture of P. Erdos and R. Guy by showing that κ(n, e)n 2/e 3 tends to a positive constant as n→∞ and n≪e≪n 2. Similar results hold for graph drawings on any other surface of fixed genus. We prove better bounds for graphs satisfying some monotone properties. In particular, we show that if G is a graph with n vertices and e≥4n edges, which does not contain a cycle of length four (resp. six), then its crossing number is at least ce 4/n 3 (resp. ce 5/n 4), where c>0 is a suitable constant. These results cannot be improved, apart from the value of the constant. This settles a question of M. Simonovits.

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

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

M3 - Chapter

SP - 124

EP - 133

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - ACM

ER -