A linear programming perspective on the Frankl—Rödl—Pippenger theorem

Type: Article

Publication Date: 1996-03-01

Citations: 0

DOI: https://doi.org/10.1002/(sici)1098-2418(199603)8:2<149::aid-rsa5>3.3.co;2-s

Locations

  • Random Structures and Algorithms - View

Similar Works

Action Title Year Authors
+ A linear programming perspective on the Frankl?R�dl?Pippenger theorem 1996 Jeff Kahn
+ PDF Chat Fractional Decompositions of Dense Hypergraphs 2005 Raphael Yuster
+ PDF Chat Fractional decompositions of dense hypergraphs 2006 Raphael Yuster
+ Linear programming and combinatorics 1979 Alan J. Hoffman
+ Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. 2020 Nikhil Bansal
David G. Harris
+ Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture 2020 Nikhil Bansal
David G. Harris
+ PDF Chat Revisiting a Cutting-Plane Method for Perfect Matchings 2020 Amber Q Chen
Kevin K. H. Cheung
P. Michael Kielstra
Avery D. Winn
+ Combinatorial and algorithmic aspects of hyperbolic polynomials 2004 Leonid Gurvits
+ PDF Chat On the Combinatorial Power of the Weisfeiler-Lehman Algorithm 2017 Martin Fürer
+ Perfect fractional matchings in random hypergraphs 1996 Michael Krivelevich
+ Perfect fractional matchings in random hypergraphs 1996 Michael Krivelevich
+ Rödl’s packing theorem 2018 Péter Frankl
Norihide Tokushige
+ PDF Chat Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture 2022 Nikhil Bansal
David G. Harris
+ PDF Chat In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics 2011 Bruno Salvy
+ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" overflow="scroll"><mml:mi>M</mml:mi></mml:math>-partitions: optimal partitions of weight for one scale pan 2004 Edwin O’Shea
+ On a hypergraph Turan problem of Frankl 2002 Peter Keevash
Benny Sudakov
+ PDF Chat Fractional and integer matchings in uniform hypergraphs 2013 Daniela Kühn
Deryk Osthus
Timothy Townsend
+ PDF Chat Random matchings in linear hypergraphs 2024 Hyunwoo Lee
+ Linear and integer programming / Gerard Sierksma 2002 Gerard Sierksma
+ Revisiting a Cutting Plane Method for Perfect Matchings 2019 Amber Q Chen
Kevin K. H. Cheung
P. Michael Kielstra
A.J. Winn

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors