Intersecting hexagons in 3-space
Metric Geometry
2021-02-02 v3 Combinatorics
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".
Cite
@article{arxiv.1705.01272,
title = {Intersecting hexagons in 3-space},
author = {Jozsef Solymosi and Ching Wong},
journal= {arXiv preprint arXiv:1705.01272},
year = {2021}
}