A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider their corresponding saturation problems. We asymptotically determine the saturation number of two geometrically disjoint r-tuples. Further, amongst the eight nonisomorphic 3-uniform cgh's on two edges, we determine the saturation number for seven of these up to order of magnitude and the eighth up to a log factor.
@article{arxiv.2109.09931,
title = {Saturation Problems in Convex Geometric Hypergraphs},
author = {Jason O'Neill and Sam Spiro},
journal= {arXiv preprint arXiv:2109.09931},
year = {2021}
}