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

2. Crossing number and edge deletion

    1. Crossing number and edge deletion


      Add remark

      Problem 2.1.

      [Jacob Fox] In any graph $G$, can we always find an edge $e$ such that $\text{cr}(G - e) \geq \text{cr}(G) - o\left(\text{cr}(G)\right)$.
          Note: It’s known there is always an edge $e$ such that $\text{cr}(G - e) \geq \frac{1}{2}\text{cr}(G)$.

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