How tight is the corner relaxation? Insights gained from the stable set problem

Gomory, 1963, An algorithm for integer solutions to linear programs, 269 Nemhauser, 1990, A recursive procedure for generating all cuts for 0–1 mixed integer programs, Mathematical Programming, 46, 379, 10.1007/BF01585752 Gomory, 1969, Some polyhedra related to combinatorial problems, Linear Algebra and its Applications, 2, 451, 10.1016/0024-3795(69)90017-2 Fischetti, 2008, How tight is the corner relaxation?, Discrete Optimization, 5, 262, 10.1016/j.disopt.2006.11.010 Grimmett, 1986, An exact threshold theorem for random graphs and the node-packing problem, Journal of Combinatorial Theory, Series B, 40, 187, 10.1016/0095-8956(86)90076-6 Grimmett, 1985, Random near-regular graphs and the node packing problem, Operations Research Letters, 4, 169, 10.1016/0167-6377(85)90024-0 Cook, 1990, Chvátal closures for mixed integer programming problems, Mathematical Programming, 47, 155, 10.1007/BF01580858 Dash, 2010, A heuristic to generate rank-1 GMI cuts, Mathematical Programming C, 2, 231, 10.1007/s12532-010-0018-0 Campêlo, 2009, Stable sets, corner polyhedra and the Chvátal closure, Operations Research Letters, 37, 375, 10.1016/j.orl.2009.06.006 Balinski, 1970, On maximum matching, minimum covering and their connections, 303 Nemhauser, 1975, Vertex packings: structural properties and algorithms, Mathematical Programming, 8, 232, 10.1007/BF01580444 Padberg, 1973, On the facial structure of set packing polyhedra, Mathematical Programming, 5, 199, 10.1007/BF01580121 M. Campêlo, G. Cornuéjols, Stable sets, corner polyhedra and the Chvátal closure, 2009. Extended version available on: http://integer.tepper.cmu.edu/. Bollobás, 2001 Corrádi, 1963, On the maximal number of independent circuits in a graph, Acta Mathematica Hungarica, 14, 423, 10.1007/BF01895727 Krivelevich, 1997, Triangle factors in random graphs, Journal of Combinatorics, Probability and Computing, 6, 337, 10.1017/S0963548397003106