New bounds on crossing numbers

Authors:
János Pach;Joel Spencer;Géza Tóth
Affiliations:
Courant Institute, NYU and Hungarian Academy of Sciences;Courant Institute, NYU;Massachusetts Institute of Technology and Hungarian Academy of Sciences
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Citing 5
Cited 2

Extremal graphs with no C4,s, or C10,s

Journal of Combinatorial Theory Series B
Planar Separators

SIAM Journal on Discrete Mathematics
New asymptotics for bipartite Tura´n numbers

Journal of Combinatorial Theory Series A
On the Number of Incidences Between Points and Curves

Combinatorics, Probability and Computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry

Combinatorics, Probability and Computing

Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics

Discrete Mathematics
Progress on crossing number problems

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract