✦ LIBER ✦

On the Number of Primitive Pythagorean Triangles

✍ Scribed by Hartmut Menzer

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 186 KB
Volume: 128
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19861280111

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on the number of triangles

Lower bounds on the number of triangles in a graph

✍ David C. Fisher 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

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 δ

A note on the matching numbers of triang

A note on the matching numbers of triangle-free graphs

✍ Roberto W. Frucht; Reinaldo E. Giudici 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

The number of edge colorings with no mon

The number of edge colorings with no monochromatic triangle

✍ Yuster, Raphael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 639 KB

Let F(n, k) denote the maximum number of t w o edge colorings of a graph on n vertices that admit no monochromatic Kk. la complete graph on k vertices). The following results are proved: f ( n , 3) = 2Ln2/41 for all n 2 6. f ( n , k) = 2((k~2)/(2k-2)+o( 1))n'. In particular, the first result solves

A Note on the Pythagorean Theorem of Bas

A Note on the Pythagorean Theorem of Baseball Production

✍ John Ruggiero; Lawrence Hadley; Gerry Ruggiero; Scott Knowles 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

Recent analyses of baseball managers' performances have employed the so-called `Pythagorean Theorem' of baseball. This `theorem' states that the ratio of wins to losses can be approximated by the square of the ratio of team runs scored to opposition runs scored. Recent publications assume this appro

On the Number of Acute Triangles in a St

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph

✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 80 KB

In this paper we show that any maximal planar graph with m triangles except the unbounded face can be transformed into a straight-line embedding in which at least WmÂ3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi