Pages that link to "Item:Q4705347"
From MaRDI portal
The following pages link to Partial Steiner systems and matchings in hypergraphs (Q4705347):
Displaying 15 items.
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104) (← links)
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree (Q2161203) (← links)
- Nearly optimal partial Steiner systems (Q2741470) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)
- (Q4351069) (← links)
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- A natural barrier in random greedy hypergraph matching (Q5222558) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Colorful Matchings (Q6098465) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)