Pages that link to "Item:Q1190514"
From MaRDI portal
The following pages link to Improved bounds for covering complete uniform hypergraphs (Q1190514):
Displaying 10 items.
- Cores of random \(r\)-partite hypergraphs (Q436312) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- \(\Sigma\Pi\Sigma\) threshold formulas (Q1340142) (← links)
- Better lower bounds for monotone threshold formulas (Q1356879) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
- Approximate Set Covering in Uniform Hypergraphs (Q4366877) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
- Fingerprinting-based minimal perfect hashing revisited (Q6579768) (← links)