✦ LIBER ✦

Stable sets, corner polyhedra and the Chvátal closure

✍ Scribed by Manoel Campêlo; Gérard Cornuéjols

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 722 KB
Volume: 37
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.06.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the MIR closure and basic rela

A note on the MIR closure and basic relaxations of polyhedra

✍ Sanjeeb Dash; Oktay Günlük; Christian Raack 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 191 KB

The interior and closure of strongly sta

The interior and closure of strongly stable matrices

✍ W. Sun 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 296 KB

On a Characterisation of the System of a

On a Characterisation of the System of all regularly closed Sets in general closure spaces

✍ Milan Sekanina 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

I n several questions concerning connections between general topologies and BOOLEAN algebras systems regularly open or closed sets play an important role. The lattice-theoretical characterisations of these systems are known for general topological spaces. Problem 81 in [I] and the paper [ 2 ] deal w

Stable and Unstable Sets for the Cauchy

Stable and Unstable Sets for the Cauchy Problem for a Nonlinear Wave Equation with Nonlinear Damping and Source Terms

✍ Grozdena Todorova 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Large cliques or stable sets in graphs w

Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement

✍ Maria Chudnovsky; Yori Zwols 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

## Abstract Erdős and Hajnal [Discrete Math 25 (1989), 37–52] conjectured that, for any graph __H__, every graph on __n__ vertices that does not have __H__ as an induced subgraph contains a clique or a stable set of size __n__^ɛ(__H__)^ for some ɛ(__H__)>0. The Conjecture 1. known to be true for gr