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

DOI10.1016/0097-3165(89)90064-2zbMATH Open0682.05005OpenAlexW1980225268MaRDI QIDQ1823939FDOQ1823939

Authors: 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

Recommendations

• Inequalities for minimal covering sets in set systems of given rank
• Disjointly representing set systems
• On disjointly representable sets
• Hypergraphs without a large star
• Systems of representatives

zbMATH Keywords

hypergraphtransversal number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On generalized graphs
• Critical hypergraphs and interesting set-pair systems
• Title not available (Why is that?)
• On two intersecting set systems and k-continuous Boolean functions
• Upper bound on the order of tau-critical hypergraphs

Cited In (14)

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

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

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