The following pages link to (Q4842748):
Displaying 7 items.
- On balanced colorings of hypergraphs (Q548768) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
