Inequalities for minimal covering sets in set systems of given rank

DOI10.1016/0166-218X(94)90108-2zbMath0802.05058MaRDI QIDQ1329820

Zsolt Tuza

Publication date: 1 December 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

inequalitiesset systemsintersecting hypergraphs\(\nu\)- critical hypergraphminimal covering setsminimal transversals

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (9)

Pseudo sunflowers ⋮ An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\) ⋮ The Binomial k‐Clique ⋮ The distribution of the relative arc density of a family of interval catch digraph based on uniform data ⋮ An investigation of new graph invariants related to the domination number of random proximity catch digraphs ⋮ Extension of one-dimensional proximity regions to higher dimensions ⋮ The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

Cites Work

• Critical hypergraphs and interesting set-pair systems
• Minimum number of elements of representing a set system of given rank
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities for minimal covering sets in set systems of given rank