| Register
\(\newcommand{\Cat}{{\rm Cat}} \) \(\newcommand{\A}{\mathcal A} \) \(\newcommand{\freestar}{ \framebox[7pt]{$\star$} }\)

Albertson conjecture and related problems

Edited by org.aimpl.user:jzeng@ucsd.edu

The problems recorded here are those discussed during the open problem session but may not include all problems mentioned during the workshop. The people listed here suggested these problems but may not necessarily be their original authors.

    Sections

    1. 1. Crossing number and edge addition
    2. 2. Crossing number and edge deletion
    3. 3. Crossing number and edge partition
    4. 4. Crossing number (and its variations) in random graphs
    5. 5. Crossing number on surfaces
    6. 6. Crossing number within a circle
    7. 7. Crossing number of cones
    8. 8. Chromatic number of generalized Kneser graphs
    9. 9. Coloring distance on planar graphs
    10. 10. Coloring distance and matching number
    11. 11. Planar-critical graphs
    12. 12. Subgraphs of quasi-planar graphs
    13. 13. Far-away crossing pairs
    14. 14. Collinear triples and self-intersection paths
    15. 15. Unavoidable crossing quaduples
    16. 16. Plane paths in simple topological graphs
    17. 17. Small hexagons in simple topological graphs
    18. 18. Distinct distances under local condition
    1. Bibliography

      Cite this as: AimPL: Albertson conjecture and related problems, available at http://aimpl.org/albertson.