Search Results for ""

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...

The anticomplementary triangle is the triangle DeltaA_1^'A_2^'A_3^' which has a given triangle DeltaA_1A_2A_3 as its medial triangle. It is therefore the anticevian triangle ...

The triangle DeltaM_AM_BM_C formed by joining the midpoints of the sides of a triangle DeltaABC. The medial triangle is sometimes also called the auxiliary triangle (Dixon ...

The circumcircle mid-arc triangle is the triangle whose vertices are given by the circumcircle mid-arc points of a given reference triangle. Its trilinear vertex matrix is ...

The excentral triangle, also called the tritangent triangle, of a triangle DeltaABC is the triangle J=DeltaJ_AJ_BJ_C with vertices corresponding to the excenters of DeltaABC. ...

The Johnson circumconic, a term used here for the first time, is the circumconic that passes through the vertices of both the reference triangle and the Johnson triangle. It ...