2 papers
math.CO2025
A Simplified Proof for the Edge-Density of 4-Planar Graphs
Aaron Büngener
A graph on vertices drawn in the plane such that each edge is crossed at most four times has at most edges -- this result, proven by Ackerman, is outstanding in…
cs.DM2025
A first view on the density of 5-planar graphs
Aaron Büngener, Jakob Franz, Michael Kaufmann +1
A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to…