The following pages link to On a problem of Erdős and Moser (Q1688260):
Displaying 4 items.
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769) (← links)
- On covering numbers of regular hypergraphs (Q1369334) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)