Minimum number of elements of representing a set system of given rank

DOI10.1016/0097-3165(89)90064-2zbMath0682.05005OpenAlexW1980225268MaRDI QIDQ1823939

Zsolt Tuza

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90064-2

zbMATH Keywords

hypergraphtransversal number

Mathematics Subject Classification ID

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

Related Items (13)

Inequalities for minimal covering sets in set systems of given rank ⋮ Uniquely \(K_r^{(k)}\)-saturated hypergraphs ⋮ Color the cycles ⋮ K^s-Free Graphs Without Large K^r-Free Subgraphs ⋮ Tolerance in Helly-type theorems ⋮ Helly’s theorem: New variations and applications ⋮ The Binomial k‐Clique ⋮ Bounded degrees and prescribed distances in graphs ⋮ Menger-type theorems with restrictions on path lengths ⋮ Helly property in finite set systems ⋮ C-perfect hypergraphs ⋮ Local constraints ensuring small representing sets ⋮ About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical hypergraphs and interesting set-pair systems
• Upper bound on the order of tau-critical hypergraphs
• On two intersecting set systems and k-continuous Boolean functions
• On generalized graphs

This page was built for publication: Minimum number of elements of representing a set system of given rank