Skip to main content
WueCampus
  • More
    English ‎(en)‎
    Català ‎(ca)‎ Deutsch ‎(de)‎ Deutsch (du) ‎(de_du)‎ English ‎(en)‎ Español - Internacional ‎(es)‎ Français ‎(fr)‎ Italiano ‎(it)‎ Português - Portugal ‎(pt)‎ Svenska ‎(sv)‎ Türkçe ‎(tr)‎ Русский ‎(ru)‎ العربية ‎(ar)‎
    You are currently using guest access
    Log in
    1. Home
    2. SS20_VG
    3. Literatur und zusätzliche Materialien
    4. Lecture #8 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry

    Lecture #8 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry

    This paper contains several applications of the crossing lemma. Be warned that the presentation is a bit dense at times. 

    Click on Lecture #8 [Székely 1997] Crossing numbers and hard Erdős problems in discrete geometry to open the resource.
    ◄ Lecture #7 [Kant and He 1994] Two algorithms for finding rectangular duals of planar graphs
    Lecture #8 [Bienstock and Dean 1993] Bounds for rectilinear crossing numbers ►
    You are currently using guest access (Log in)
    Get the mobile app
    Impressum + Datenschutzerklärung + Erklärung zur Barrierefreiheit
    Powered by Moodle