On the number of non-intersecting hexagons in 3-space
József Solymosi, Ching Kian Wong · arXiv (Cornell University) · 2017
Two hexagons in the space are said to intersect badly if the intersection of their convex hulls consists of at least one common vertex as well as an interior point. We are going to show that the number of hexagons on n points in 3-space without bad intersections is o(n^2), under the assumption that the hexagons are fat.