The following pages link to Multicovering hypergraphs (Q2022167):
Displaying 16 items.
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Covering numbers of regular multigraphs (Q753843) (← links)
- Covering the complete graph by partitions (Q916671) (← links)
- Efficient covering designs of the complete graph (Q1378499) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- Covering the edges of a random hypergraph by cliques (Q2158205) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
- Partial covering of hypergraphs (Q2921715) (← links)
- (Q3222235) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)