The following pages link to Intersections of k-element sets (Q1166522):
Displaying 8 items.
- Notes on use of generalized entropies in counting (Q503654) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- A construction for large families of k-element sets having the Erdős intersection property (Q1065799) (← links)
- Explicit construction of exponential sized families of k-independent sets (Q1073031) (← links)
- Families of finite sets in which no set is covered by the union of two others (Q1166519) (← links)
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs (Q2205125) (← links)
- Exhaustive testing of almost all devices with outputs depending on limited number of inputs (Q4391010) (← links)
- On the independence number of sparse graphs (Q4851930) (← links)
