✦ LIBER ✦

Maximum bipartite subgraphs of Kneser graphs

✍ Scribed by Svatopluk Poljak; Zsolt Tuza

Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 541 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite Subgraphs of Graphs with Maxim

Bipartite Subgraphs of Graphs with Maximum Degree Three

✍ Stanisław Bylka; Adam Idzik; Jan Komar 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 108 KB

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

Largest bipartite subgraphs in triangle-

Largest bipartite subgraphs in triangle-free graphs with maximum degree three

✍ J. A. Bondy; S. C. Locke 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

Let G be a triangle-free, loopless graph with maximum degree three. We display a polynomi$ algorithm which returns a bipartite subgraph of G containing at least 5 of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3-regular, triangle-free, loopless, c

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

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

Two hamilton cycles in bipartite reflect

Two hamilton cycles in bipartite reflective kneser graphs

✍ I.J. Dejter; J. Cordova; J.A. Quintana 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 477 KB