Search Results for ""

The 20 Cayley lines generated by a hexagon inscribed in a conic section pass four at a time though 15 points known as Salmon points (Wells 1991). There is a dual relationship ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

Through a point K in the plane of a triangle DeltaABC, draw parallelians through a point as illustrated above. Then there exist four points K for which ...

Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...

One of the four divisions of observations which have been grouped into four equal-sized sets based on their statistical rank. The quartile including the top statistically ...

A region in a knot or link projection plane surrounded by a circle such that the knot or link crosses the circle exactly four times. Two tangles are equivalent if a sequence ...

A game described by Scarne which is played on a 5×5 board by two players who alternate placing, one at a time, their four counters each, after which the counters are moved ...

A quadrilateral, sometimes also known as a tetragon or quadrangle (Johnson 1929, p. 61) is a four-sided polygon. If not explicitly stated, all four polygon vertices are ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...