Pages that link to "Item:Q659756"
From MaRDI portal
The following pages link to Covering complete hypergraphs with cuts of minimum total size (Q659756):
Displaying 6 items.
- On the decomposition of random hypergraphs (Q684118) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Minimal covers of infinite hypergraphs (Q2324493) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)