Properties of closure operators in the plane
From MaRDI portal
Publication:6325562
arXiv1909.08489MaRDI QIDQ6325562FDOQ6325562
Authors: Pavel Paták
Publication date: 18 September 2019
Abstract: We prove a general version of Radon's theorem for finite families of sets in zero-, one- and two-dimensional (pseudo)manifolds and graphs. The only requirement is that for each the intersection has bounded number of path-connected components. As a consequence we obtain Helly's and Tverberg's theorems, fractional and colorful Helly theorems, existence of weak -nets and -theorems. More precisely, if is an intersection-closed family in a topological space and , we define its convex hull as the smallest set in that contains . The Radon number is then the smallest integer such that every set of size can be split into two disjoint subsets with intersecting convex hulls. For every graph with vertices we construct a polynomial satisfying the following three conditions. 1) If , . 2) If , the degree of is at most . 3) If the graph does not almost-embed into a topological space , and is a finite and intersection-closed family of sets in , such that each member of has at most path-connected components, then . In particular, if is a family of sets in , . The proof further refines the constrained chain map method introduced by Goaoc, Pat'ak, Pat'akov'a, Tancer and Wagner; and further developed by Pat'akov'a. In the plane, we manage to overcome the use of hypergraph Ramsey theorem and provide polynomial size bounds.
Graph theory (including graph drawing) in computer science (68R10) Helly-type theorems and geometric transversal theory (52A35)
This page was built for publication: Properties of closure operators in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325562)