A graph drawn in the plane with vertices is -fan-crossing free for if there are no edges , such that have a common endpoint and crosses all . We prove a tight bound of on the maximum number of edges of a -fan-crossing free graph, and a tight bound for a straight-edge drawing. For , we prove an upper bound of edges. We also discuss generalizations to monotone graph properties.