A new lower bound on the maximum number of plane graphs using production matrices
Abstract
We use the concept of production matrices to show that there exist sets of n points in the plane that admit (42.11n) crossing-free geometric graphs. This improves the previously best known bound of (41.18n) by Aichholzer et al. (2007).
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.