English

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

Combinatorics 2022-08-05 v1

Abstract

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

Keywords

Cite

@article{arxiv.2208.02324,
  title  = {Maximising the number of regions when embedding a N-cycle graph},
  author = {Adam Dunajski},
  journal= {arXiv preprint arXiv:2208.02324},
  year   = {2022}
}

Comments

5 pages, 5 figures