𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a maximum-property characterizing the angles of a triangle

✍ Scribed by Paul Szász

Publisher
Springer Vienna
Year
1962
Tongue
English
Weight
174 KB
Volume
66
Category
Article
ISSN
0026-9255

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum induced forests of a conn
On the maximum induced forests of a connected cubic graph without triangles
✍ Maolin Zheng; Xiaoyun Lu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Let t(G) denote the cardinality of a maximum induced forest of a graph G with n vertices. For connected simple cubic graphs G without triangles, it is shown that r(G) 3 2n/3 except for two particular graphs. This lower bound is sharp and it improves a result due to J.A. Bondy, et al. [l]. Using this

Characterization of a class of triangle-
Characterization of a class of triangle-free graphs with a certain adjacency property
✍ Brian Alspach; C. C. Chen; Katherine Heinrich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e

The maximum number of triangles in a K4-
The maximum number of triangles in a K4-free graph
✍ Jürgen Eckhoff 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Let v, e and t denote the number of vertices, edges and triangles, respectively, of a K4-free graph. Fisher (1988) proved that t<,(e/3) 3/2, independently of v. His bound is attained when e = 3k 2 for some integer k, but not in general. We find here, for any given value of e, the maximum possible va