A new lower bound on the maximum number of plane graphs using production matrices

Clemens Huemer, Alexander Pilz, Rodrigo I. Silveira*

*Corresponding author for this work

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)36-49
Number of pages14
JournalComputational Geometry
Volume84
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'A new lower bound on the maximum number of plane graphs using production matrices'. Together they form a unique fingerprint.

Cite this