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

DOI10.1002/(SICI)1098-2418(199603)8:2%3C149::AID-RSA5%3E3.0.CO;2-YMaRDI QIDQ4870539zbMATH OpenOpenAlexFDO

Authors J. Kahn

Publication date 20 March 1996

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199603)8:2%3C149::aid-rsa5%3E3.0.co;2-y

zbMATH Keywords

fractional matchinghypergraphlinear programs

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear programming (90C05)

Recommendations

• Fractional v. integral covers in hypergraphs of bounded edge size
• On the fractional matching polytope of a hypergraph
• On a criterion for matchability in hypergraphs

Cited in

(13)

• Fractional v. integral covers in hypergraphs of bounded edge size
• The generalised Oberwolfach problem
• A hypergraph blow-up lemma
• Long gaps between primes
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Pseudorandom hypergraph matchings
• 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
• Generalized Tuza's conjecture for random hypergraphs
• Approximate generalized Steiner systems and near-optimal constant weight codes
• Asymptotically optimal constant weight codes with even distance
• Ringel's tree packing conjecture in quasirandom graphs

This page was built for publication: A linear programming perspective on the Frankl?R�dl?Pippenger theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870539)