Bae et al. [1]} have shown that the number of edges
in \(n\) -vertex \(k\) -planar graphs is at most \(\max \lbrace 5.58\sqrt{k},17.17\rbrace  n\)  and at most \(5n-10\)  for \(k=1\) . The Crossing Lemma and
\(cr(K_{12})=150\)  [2]} provide simple examples of non
1-gap-planar graphs. Our example is an alternative to the RAC and
non 1-planar graph by Eades and Liotta [3]}, which
has 85 vertices and is constructed from \(K_5\)  by an addition of
many short paths similar to the graph in Theorem REF .
