The Number of Edges in a k–Helly Hypergraph

DOI10.1016/S0304-0208(08)73427-3MaRDI QIDQ3672028zbMATH OpenOpenAlexFDO

Authors Henry Martyn Mulder

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73427-3

zbMATH Keywords

uniform hypergraphsHelly propertysubhypergraphTuran's hypergraph problem

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cited in

(4)

• Largest size and union of Helly families
• Matchings and covers in hypergraphs
• The minimum number of maximal independent sets in twin-free graphs
• Helly property in finite set systems

This page was built for publication: The Number of Edges in a k–Helly Hypergraph

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