𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Maximum Number of Equilateral Triangles, I

✍ Scribed by B. M. Ábrego; S. Fernández-Merchant

Publisher
Springer
Year
2000
Tongue
English
Weight
75 KB
Volume
23
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The dissection of a polygon into nearly
The dissection of a polygon into nearly equilateral triangles
✍ Joseph L. Gerver 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 587 KB

Every polygon can be dissected into acute triangles. In this paper we prove that every polygon, such that the interior angles are at least n/5, can be dissected into triangles with interior angles all less than or equal to 2n/5. We find necessary conditions on the interior angles of the polygon in o

The number of triangles in 2-factorizati
The number of triangles in 2-factorizations
✍ Qidi Sui; Beiliang Du 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract Given an arbitrary 2‐factorization ${\cal F} = {F\_{1},F\_{2}, \cdots , F\_{v - 1/2}}$ of $K\_{v}$, let δ~__i__~ be the number of triangles contained in __F~i~__, and let δ = Σδ~__i__~. Then $\cal F$ is said to be a 2‐factorization with δ triangles. Denote by Δ(__v__), the set of all δ