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(n2), under the assumption that the hexagons are ‘fat’.
J. Carmesin. Embedding simply connected 2-complexes in 3-space – I. A Kuratowski-type characterisation. preprint, arXiv:1709.04642v3.
T. K. Dey and J. Pach. Extremal problems for geometric hypergraphs. Discrete Comput. Geom., 19(4):473–484, 1998.
G. Kalai. Communication with J. Solymosi at Euroconference in Mathematics on Crete, Ano- gia, Greece, 19-25 August 2000. (Organizers E. Welzl and G. M. Ziegler.)
G. Károlyi and J. Solymosi. Almost disjoint triangles in 3-space. Discrete and computational geometry and graph drawing (Columbia, SC, 2001). Discrete Comput. Geom., 28(4):577–583, 2002.
P. McMullen, Ch. Schulz and J. M. Wills. Polyhedral 2-manifolds in E3 with unusually large genus. Israel J. Math., 46(1–2):127–144, 1983.
L. Neuwirth. An algorithm for the construction of 3-manifolds from 2-complexes. Proc. Cambridge Philos. Soc., 64:603–613, 1968.
I. Z. Ruzsa and E. Szemerédi. Triple systems with no six points carrying three triangles. In Combinatorics, (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978, pp. 939–945.
G. M. Ziegler. Polyhedral surfaces of high genus. In Discrete diflerential geometry, Ober-wolfach Semin., 38, Birkhauser, Basel, 2008, pp. 191–213.