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

Huemer, Clemens; Pilz, Alexander; Silveira, Rodrigo Ignacio

doi:10.1016/j.comgeo.2019.07.005

View/Open

Final journal version (CGTA) (660,1Kb)

View UPCommons Usage Statistics

LA Referencia / Recolecta stats

Cita com:

Show full item record

Huemer, Clemens

Pilz, Alexander

Silveira, Rodrigo Ignacio

Document typeArticle

Defense date2019-11-01

Rights accessOpen Access

Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain

ProjectGRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES (MINECO-MTM2015-63791-R)
CONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)

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).

Description

CitationHuemer, C.; Pilz, A.; Silveira, R. A new lower bound on the maximum number of plane graphs using production matrices. "Computational geometry: theory and applications", 1 Novembre 2019, vol. 84, p. 36-49.

URIhttp://hdl.handle.net/2117/177726

DOI10.1016/j.comgeo.2019.07.005

ISSN0925-7721

Publisher versionhttps://www.sciencedirect.com/science/article/abs/pii/S092577211930104X

Other identifiershttps://arxiv.org/pdf/1902.09841.pdf

Collections