Saturation Problems in Convex Geometric Hypergraphs

DOI10.1016/J.EJC.2023.103702arXiv2109.09931MaRDI QIDQ6378142FDOQ6378142

Publication date: 20 September 2021

Abstract: 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.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

This page was built for publication: Saturation Problems in Convex Geometric Hypergraphs

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