Search Results for ""

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...

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), ...

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, ...

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 ...

In the above figure, let E be the intersection of AD and BC and specify that AB∥EF∥CD. Then 1/(AB)+1/(CD)=1/(EF). A beautiful related theorem due to H. Stengel can be stated ...