Before revision: A graph is fan-crossing free if it admits  a drawing in the plane so that each edge can be crossed by independent edges . Then the crossing edges have distinct vertices.
After revision: A graph is fan-crossing free if it admits a drawing in the plane so that each edge can be crossed by independent edges , that is the crossing edges have distinct vertices.