1 problem

0 votes0 replies0 views
Pach et al.'s extremal conjecture for simple $k$ -planar graphs
Pach et al.'s conjecture. For all $k,n\geq 1$ , this maximum is attained by a graph that admits a simple $k$ -plane drawing.
Conjectureopengraph-drawings k-planar-graphs topological-graph-theoryarXiv posted 2 days ago

Pach et al.'s extremal conjecture for simple kkk-planar graphs