Minimum number of elements of representing a set system of given rank
From MaRDI portal
Publication:1823939
Recommendations
Cites work
- Critical hypergraphs and interesting set-pair systems
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- On generalized graphs
- On two intersecting set systems and k-continuous Boolean functions
- Upper bound on the order of tau-critical hypergraphs
Cited in
(14)- Helly property in finite set systems
- Inequalities for minimal covering sets in set systems of given rank
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs
- Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects
- About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets
- Helly’s theorem: New variations and applications
- C-perfect hypergraphs
- Color the cycles
- Ks-Free Graphs Without Large Kr-Free Subgraphs
- The binomial \(k\)-clique
- Tolerance in Helly-type theorems
- Bounded degrees and prescribed distances in graphs
- Menger-type theorems with restrictions on path lengths
- Local constraints ensuring small representing sets
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)