Pages that link to "Item:Q1125617"
From MaRDI portal
The following pages link to More-than-nearly-perfect packings and partial designs (Q1125617):
Displaying 16 items.
- Nearly-perfect hypergraph packing is in NC (Q286955) (← links)
- A brief survey of perfect Mendelsohn packing and covering designs (Q1302146) (← links)
- Packing of partial designs (Q1323485) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Nearly optimal partial Steiner systems (Q2741470) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- Note on asymptotically good packings (Q3578141) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Partial Steiner systems and matchings in hypergraphs (Q4705347) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)