101512 20210902121728.0 doi 10.1016/j.comgeo.2020.101653 sideral 118264 ART-2020-118264 eng Biniaz, Ahmad Packing plane spanning trees into a point set 2020 Access copy available to the general public Unrestricted Let P be a set of n points in the plane in general position. We show that at least ¿n/3¿ plane spanning trees can be packed into the complete geometric graph on P. This improves the previous best known lower bound O(n). Towards our proof of this lower bound we show that the center of a set of points, in the d-dimensional space in general position, is of dimension either 0 or d. info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT This project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No H2020 734922-CONNECT info:eu-repo/grantAgreement/ES/MINECO/MTM2015-63791-R info:eu-repo/semantics/openAccess by-nc-nd http://creativecommons.org/licenses/by-nc-nd/3.0/es/ 0.537 2020 MATHEMATICS, APPLIED 255 / 265 = 0.962 2020 Q4 T3 MATHEMATICS 288 / 330 = 0.873 2020 Q4 T3 0.354 2020 Computational Mathematics 2020 Q3 Computational Theory and Mathematics 2020 Q3 Geometry and Topology 2020 Q3 Control and Optimization 2020 Q3 Computer Science Applications 2020 Q3 info:eu-repo/semantics/article info:eu-repo/semantics/acceptedVersion García, Alfredo Universidad de Zaragoza (orcid)0000-0002-6519-1472 2007 265 Universidad de Zaragoza Dpto. Métodos Estadísticos Área Estadís. Investig. Opera. 90 (2020), 101653 [5 pp.] Comput. geom. Computational Geometry: Theory and Applications 0925-7721 299144 http://zaguan.unizar.es/record/101512/files/texto_completo.pdf Postprint 2203217 http://zaguan.unizar.es/record/101512/files/texto_completo.jpg?subformat=icon icon Postprint oai:zaguan.unizar.es:101512 articulos driver 2021-09-02-09:33:58 ARTICLE