Maximising the number of regions when embedding a N-cycle graph
Abstract
We find the maximal number of regions that a straight line embedding of a N-cycle graph can enclose.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.