The following pages link to Covering a set by subsets (Q912112):
Displaying 14 items.
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Combinatorial problems connected with P. Hall's collection process (Q779146) (← links)
- On coverings of a finite set: Depth and subcovers (Q797579) (← links)
- Covering sets by subsets (Q797580) (← links)
- A bound on the overlap of same-sized subsets (Q1021379) (← links)
- Finding balance: split graphs and related classes (Q1753048) (← links)
- Estimating the size of a union of random subsets of fixed cardinality (Q1871652) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Binary linear complementary dual codes (Q2311425) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Covering the Recursive Sets (Q3195679) (← links)
- (Q4989361) (← links)
- The number of certain \(k\)-combinations of an \(n\)-set (Q5505270) (← links)
- Applied Cryptography and Network Security (Q5899216) (← links)