Crossing numbers and combinatorial characterization of monotone drawings of $K_n$

@article{Balko2015CrossingNA,
  title={Crossing numbers and combinatorial characterization of monotone drawings of \$K_n\$},
  author={Martin Balko and Radoslav Fulek and Jan Kyncl},
  journal={Discrete & Computational Geometry},
  year={2015},
  volume={53},
  pages={107-143}
}
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1 4 ⌊n 2 ⌋ ⌊ 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS
13 Citations
41 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Sweeps

  • S. Felsner, H. Weil
  • arrangements and signotopes, Discrete Appl. Math…
  • 2001
Highly Influential
4 Excerpts

On the number of crossings in a complete graph

  • F. Harary, A. Hill
  • Proc. Edinburgh Math. Soc. (2) 13
  • 1963
Highly Influential
9 Excerpts

A combinatorial problem

  • R. K. Guy
  • Nabla (Bull. Malayan Math. Soc) 7
  • 1960
Highly Influential
9 Excerpts

Recent developments on the crossing number of the complete graph

  • P. Ramos
  • invited talk at the XV Spanish Meeting on…
  • 2013
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…