patmorin/fan-partition

Fan-Partitions of Planar Graphs (and Beyond) by Local Sparsification and Volume-Preserving Emeddings

We show that every $n$-vertex planar graph is contained in the strong product of a fan and a clique of size $\sqrt{n}\log^{O(1)} n$.