1 problem

Pach et al.'s conjecture. For every $k$, there is a max-saturated $k$-planar graph with a simple $k$-planar drawing.