A graph drawn in the plane with n vertices is fan-crossing free if there is no triple of edges e; f and g, such that e and f have a common endpoint and g crosses both e and f. We prove a tight bound of 4n < 9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4n < 8 if the edges are Jordan curves. We discuss generalizations to radial (k,1)-grid free graphs and monotone graph properties.