𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite Subgraphs of Triangle-Free Graphs

✍ Scribed by Poljak, Svatopluk; Tuza, Zsolt

Book ID
118197237
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
697 KB
Volume
7
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

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

Graphs without large triangle free subgr
Graphs without large triangle free subgraphs
✍ B. BollobΓ‘s; H.R. Hind πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 751 KB

Bollobas, B. and H.R. Hind, Graphs without large triangle free subgraphs, Discrete Mathematics 87 (1991) 119-131. The main aim of the paper is to show that for 2 < r <s and large enough n, there are graphs of order n and clique number less than s in which every set of vertices, which is not too sma