Source: wikibot/planar-separator-theorem
= Planar separator theorem
{wiki=Planar_separator_theorem}
The Planar Separator Theorem is a concept in computational geometry and graph theory which states that for any planar graph, it is possible to partition the vertices of the graph into three disjoint sets: X, Y, and S. The sets have the following properties: 1. **Small Separator Size**: The size of the set S (the separator) is proportional to the square root of the number of vertices in the graph.