✦ LIBER ✦

Triangles with Three Rational Medians

✍ Scribed by Ralph H. Buchholz

Book ID: 102973537
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 905 KB
Volume: 97
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.2002.2777

No coin nor oath required. For personal study only.

✦ Synopsis

We present a characterization of all rational sided triangles with three rational medians. It turns out that they each correspond to a point on a one-parameter family of elliptic curves. It is possible to show that the rank of this family is at least two and in fact some reasonably high rank curves appear among them.

📜 SIMILAR VOLUMES

Elliptic curves and Triangles with three

Elliptic curves and Triangles with three rational medians

✍ Dujella, Andrej; Peral, Juan Carlos 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Triangles in a complete chromatic graph

Triangles in a complete chromatic graph with three colors

✍ A.W Goodman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for

Approximation algorithms for three-dimen

Approximation algorithms for three-dimensional assignment problems with triangle inequalities

✍ Yves Crama; Frits C.R. Spieksma 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Vertex-Disjoint Triangles in Claw-Free G

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three

✍ Hong Wang 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 160 KB

Size and independence in triangle-free g

Size and independence in triangle-free graphs with maximum degree three

✍ Kathryn Fraughnaugh Jones 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 549 KB

## Abstract Let __C__ be the class of triangle‐free graphs with maximum degree at most three. A lower bound for the number of edges in a graph of __C__ is derived in terms of the number of vertices and the independence. Several classes of graphs for which this bound is attained are given. As coroll

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