Stability of Erd\H{o}s-Ko-Rado Theorems in Circle Geometries
Sam Adriaensen

TL;DR
This paper investigates the stability and structure of largest intersecting families in finite circle geometries, extending known results to M"obius planes of odd order and non-ovoidal geometries, with implications for geometric combinatorics.
Contribution
It characterizes largest intersecting families in M"obius planes of odd order and non-ovoidal geometries, and establishes a stability result for large families in finite circle geometries.
Findings
Largest intersecting families are circles through a fixed point in M"obius planes of order > 3.
Similar results hold for non-ovoidal circle geometries.
Large intersecting families must contain circles through a common point or nucleus.
Abstract
Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in 3-dimensional space. In a previous paper, the author characterised the largest intersecting families in finite ovoidal circle geometries, except for M\"obius planes of odd order. In this paper we show that also in these M\"obius planes, if the order is greater than 3, the largest intersecting families are the sets of circles through a fixed point. We show the same result in the only known family of finite non-ovoidal circle geometries. Using the same techniques, we show a stability result on large intersecting families in all ovoidal circle geometries. More specifically, we prove that an intersecting family in one of the known finite circle geometries of order , with , must consist of circles…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
