𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite subgraphs

✍ Scribed by Noga Alon

Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
455 KB
Volume
16
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On maximum bipartite subgraphs
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

Small bipartite subgraph polytopes
Small bipartite subgraph polytopes
✍ Laura Galli; Adam N. Letchford πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 272 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

Bipartite subgraphs of integer weighted
Bipartite subgraphs of integer weighted graphs
✍ Noga Alon; Eran Halperin πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 411 KB

For every integer p > 0, let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f((~)+m)= LΒΌn2j +min (IΒ½nT,f(m)). This supplies the precise value of f(p) for many values of p includin