Pages that link to "Item:Q286955"
From MaRDI portal
The following pages link to Nearly-perfect hypergraph packing is in NC (Q286955):
Displaying 10 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Constructive Packings of Triple Systems (Q4591229) (← links)
- Constructive Packings by Linear Hypergraphs (Q5397735) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)