✦ LIBER ✦

Small bipartite subgraph polytopes

✍ Scribed by Laura Galli; Adam N. Letchford

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 272 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite subgraphs

✍ Noga Alon 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 455 KB

On two-connected subgraph polytopes

✍ Francisco Barahona; Ali Ridha Mahjoub 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 674 KB

We further study some known families of valid inequalities for the 2-edge-connected and 2-node-connected subgraph polytopes. For the 2-edge-connected case, we show that the odd wheel inequalities together with the obvious constraints give a complete description of the polytope for Halin graphs. For

On maximum bipartite subgraphs

✍ Günther Malle 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

## Abstract In this paper are investigated maximum bipartite subgraphs of graphs, i.e., bipartite subgraphs with a maximum number of edges. Such subgraphs are characterized and a criterion is given for a subgraph to be a unique maximum bipartite subgraph of a given graph. In particular maximum bipa

On the acyclic subgraph polytope

✍ Martin Grötschel; Michael Jünger; Gerhard Reinelt 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 768 KB

On thek-cut subgraph polytope

✍ Kalyan T. Talluri; Donald K. Wagner 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 774 KB

On Ramsey graphs without bipartite subgr

On Ramsey graphs without bipartite subgraphs

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 388 KB

NeSetfil, J. and V. Riidl, On Ramsey graphs without bipartite subgraphs, Discrete Mathematics 101 (1992) 223-229. We prove that for every graph H without triangles and K,,,,,m, n G 2, there exists a Ramsey graph with the same properties. This answers a problem due to Erd& and Faudree. Moreover we