arXiv Open Access 2019

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

Clemens Huemer Alexander Pilz Rodrigo I. Silveira

Lihat Sumber

Abstrak

We use the concept of production matrices to show that there exist sets of $n$ points in the plane that admit $Ω(42.11^n)$ crossing-free geometric graphs. This improves the previously best known bound of $Ω(41.18^n)$ by Aichholzer et al. (2007).

Topik & Kata Kunci

cs.CG cs.DM

Penulis (3)

Clemens Huemer

Alexander Pilz

Rodrigo I. Silveira

Format Sitasi

APA MLA BibTeX

Huemer, C., Pilz, A., Silveira, R.I. (2019). A new lower bound on the maximum number of plane graphs using production matrices. https://arxiv.org/abs/1902.09841

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓