Search Results for ""

Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

A statement about theorems. It usually gives a criterion for getting a new theorem from an old one, either by changing its objects according to a rule (duality principle), or ...

The Brocard inellipse is the inconic with parameters x:y:z=1/a:1/b:1/c, (1) giving the trilinear equation ...

The Lemoine ellipse is an inconic (that is always an ellipse) that has inconic parameters x:y:z=(2(b^2+c^2)-a^2)/(bc):(2(a^2+c^2)-b^2)/(ac): (2(a^2+b^2)-c^2)/(ab). (1) The ...

The MacBeath triangle DeltaX_AX_BX_C (a term coined here for the first time), is the triangle whose vertices are the contact points of the MacBeath inconic with the reference ...

The inconic having inconic parameters x:y:z=a/(b+c-a):b/(a+c-b):c/(a+b-c). Its center is the mittenpunkt M of the triangle and its Brianchon point is the Nagel point Na. The ...

The point at which the three lines connecting the vertices of two perspective triangles concur, sometimes also called the perspective center, homology center, or pole. In the ...

An inconic with parameters x:y:z=a(b-c):b(c-a):c(a-b), (1) giving equation (2) (Kimberling 1998, pp. 238-239). Its focus is Kimberling center X_(101) and its conic section ...

Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...