Maximising the number of regions when embedding a N-cycle graph

Adam Dunajski

We find the maximal number of regions that a straight line embedding of a N-cycle graph can enclose.