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

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/122911

Title:	A new lower bound on the maximum number of plane graphs using production matrices
Author:	Huemer, Clemens; Pilz, Alexander; Silveira, Rodrigo Ignacio
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry; Universitat Politècnica de Catalunya. CGA -Computational Geometry and Applications
Abstract:	We use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer et al. (2007)
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística -Computational geometry -Geometria computacional
Rights:
Document type:	Article - Published version Conference Object
Share: