Pages that link to "Item:Q4870539"
From MaRDI portal
The following pages link to A linear programming perspective on the Frankl?R�dl?Pippenger theorem (Q4870539):
Displaying 11 items.
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- The generalised Oberwolfach problem (Q2664557) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Long gaps between primes (Q4588341) (← links)
- Integer and fractional packings in dense 3‐uniform hypergraphs (Q4805219) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Tuza's conjecture for random graphs (Q6076736) (← 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)
- Generalized Tuza's conjecture for random hypergraphs (Q6581615) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)