Helly-type hypergraphs and Sperner families

DOI10.1016/S0195-6698(84)80032-3zbMath0541.05046OpenAlexW2029597239MaRDI QIDQ794670

Zsolt Tuza

Publication date: 1984

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80032-3

zbMATH Keywords

uniform hypergraphSperner familyHelly-type hypergraphintersecting set-pair system

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (10)

Inequalities for two set systems with prescribed intersections ⋮ On half-way AZ-style identities ⋮ Covering all cliques of a graph ⋮ An AZ-style identity and Bollobás deficiency ⋮ Helly property in finite set systems ⋮ A conjecture on triangles of graphs ⋮ Matchings and covers in hypergraphs ⋮ Hypergraphs without a large star ⋮ Critical hypergraphs and interesting set-pair systems ⋮ Largest size and union of Helly families

Cites Work

• Unnamed Item
• Helly families of maximal size
• On generalized graphs
• A short proof of Sperner's lemma

This page was built for publication: Helly-type hypergraphs and Sperner families