On $k$-planar Graphs without Short Cycles

Michael A. Bekos, Prosenjit Bose, Aaron Büngener +6

We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edg…