Set systems without a simplex, Helly hypergraphs and union-efficient families

MaRDI QIDQ6415425zbMATH OpenFDO

Authors Stijn Cambie, Nika Salia

Publication date 28 October 2022

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Extremal set theory (05D05)

Abstract: We present equivalent formulations for concepts related to set families for which every subfamily with empty intersection has a bounded sub-collection with empty intersection. Hereby, we summarize the progress on the related questions about the maximum size of such families. In this work we solve a boundary case of a problem of Tuza for non-trivial $q$-Helly families, by applying Karamata's inequality and determining the minimum size of a $2$-self-centered graph for which the common neighborhood of every pair of vertices contains a clique of size $q-2$.

This page was built for publication: Set systems without a simplex, Helly hypergraphs and union-efficient families

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