Intersecting hexagons in 3-space

DOI10.1556/012.2022.01514MaRDI QIDQ6286226arXivFDO

Authors József Solymosi, Ching Wong

Publication date 3 May 2017

Published in arXiv

Full work available at URL https://doi.org/10.1556/012.2022.01514

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial complexity of geometric structures (52C45)

arXiv classification

math.COmath.MG

Abstract: Two hexagons in the space are said to intersect heavily if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on n points in 3-space without heavy intersections is o(n^2), under the assumption that the hexagons are "fat".

This page was built for publication: Intersecting hexagons in 3-space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286226)