𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large triangle-free subgraphs in graphs withoutK4

✍ Scribed by P. Frankl; V. Rödl

Publisher
Springer Japan
Year
1986
Tongue
English
Weight
504 KB
Volume
2
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

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

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.