The following pages link to A finite set covering theorem (Q5618373):
Displayed 20 items.
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- Multiply-intersecting families (Q1186135) (← links)
- The minimal number of basic elements in a multiset antichain (Q1254998) (← links)
- The edge-coloring of complete hypergraphs. I (Q1260045) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Application of hypergraph Hoffman's bound to intersecting families (Q2152770) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- Multiply-intersecting families revisited (Q2384803) (← links)
- Some exact results for multiply intersecting families (Q2421557) (← links)
- Brace-Daykin type inequalities for intersecting families (Q2462339) (← links)
- Non-trivial 3-wise intersecting uniform families (Q2689515) (← links)
- An extension of the Erdős–Ko–Rado Theorem (Q3439573) (← links)
- Regularity Conditions and Intersecting Hypergraphs (Q3931438) (← links)
- Sets of finite sets satisfying union conditions (Q3950563) (← links)
- The maximum measure of non-trivial 3-wise intersecting families (Q6120852) (← links)
- Non-trivial \(r\)-wise intersecting families (Q6155545) (← links)