A geometric graph is a drawn in the plane so that its vertices and edges are represented by points general position straight line segments, respectively. vertex of called pointed if it lies outside convex hull neighbours. We show for with $$n$$ $$e$$ there at least $$\frac{n}{2}\left(\begin{array}{cc}2e/n\\3\end{array}\right)$$ pairs disjoint provided $$2e\ge n$$ all pointed. Besides, we prove ...