Search Results for ""

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

For a diagonal metric tensor g_(ij)=g_(ii)delta_(ij), where delta_(ij) is the Kronecker delta, the scale factor for a parametrization x_1=f_1(q_1,q_2,...,q_n), ...

Four circles c_1, c_2, c_3, and c_4 are tangent to a fifth circle or a straight line iff T_(12)T_(34)+/-T_(13)T_(42)+/-T_(14)T_(23)=0. (1) where T_(ij) is the length of a ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

Connect-Four is a tic-tac-toe-like two-player game in which players alternately place pieces on a vertical board 7 columns across and 6 rows high. Each player uses pieces of ...

A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...

Let three similar isosceles triangles DeltaA^'BC, DeltaAB^'C, and DeltaABC^' be constructed on the sides of a triangle DeltaABC. Then DeltaABC and DeltaA^'B^'C^' are ...

The canonical bundle is a holomorphic line bundle on a complex manifold which is determined by its complex structure. On a coordinate chart (z_1,...z_n), it is spanned by the ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

Let sigma_1, ..., sigma_4 be four planes in general position through a point P and let P_(ij) be a point on the line sigma_i·sigma_j. Let sigma_(ijk) denote the plane ...