A linear programming perspective on the Frankl?R�dl?Pippenger theorem

DOI<149::AID-RSA5>3.0.CO;2-Y 10.1002/(SICI)1098-2418(199603)8:2<149::AID-RSA5>3.0.CO;2-YzbMath0842.05066OpenAlexW1990381101MaRDI QIDQ4870539

Jeffry Kahn

Publication date: 20 March 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199603)8:2<149::aid-rsa5>3.0.co;2-y

zbMATH Keywords

hypergraphlinear programsfractional matching

Mathematics Subject Classification ID

Linear programming (90C05) Hypergraphs (05C65)

Related Items

Integer and fractional packings in dense 3‐uniform hypergraphs ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ The generalised Oberwolfach problem ⋮ Long gaps between primes ⋮ Tuza's conjecture for random graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ A hypergraph blow-up lemma ⋮ Pseudorandom hypergraph matchings