Helly property in finite set systems

DOI10.1016/0097-3165(93)90068-JzbMath0773.05096MaRDI QIDQ1208035

Zsolt Tuza

Publication date: 16 May 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

convex hullHelly propertyHelly theoremLYM-type inequalitySpernerfinite set systemBollobas inequality

Mathematics Subject Classification ID

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

Related Items

Covering random graphs with monochromatic trees, The colorful Helly theorem and general hypergraphs, An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph, A polynomial algorithm for the strong Helly property, Largest size and union of Helly families

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On Helly families of maximal size
• A new short proof for the Kruskal-Katona theorem
• Helly-type hypergraphs and Sperner families
• Intersecting Sperner families and their convex hulls
• Local constraints ensuring small representing sets
• The Helly property
• On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
• A class of constructions for Turan's (3,4)-problem
• A short proof of Kneser's conjecture
• Helly families of maximal size
• Extremal problems for finite sets and convex hulls---a survey
• Minimum number of elements of representing a set system of given rank
• Logarithmic order of free distributive lattice
• The Number of Edges in a k–Helly Hypergraph
• An Extremal Set-Intersection Theorem
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item