A Simplified Proof for the Edge-Density of 4-Planar Graphs

Aaron Büngener

A graph on $n\ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result, proven by Ackerman, is outstanding in…