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).
Original language | English |
---|---|
Pages (from-to) | 36-49 |
Number of pages | 14 |
Journal | Computational Geometry |
Volume | 84 |
DOIs | |
Publication status | Published - 1 Nov 2019 |
Keywords
- Graphs counting
- Lower bounds
- Plane graphs
- Production matrix
ASJC Scopus subject areas
- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics