Search Results for ""

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

The "Foxtrot series" is a mathematical sum that appeared in the June 2, 1996 comic strip FoxTrot by Bill Amend (Amend 1998, p. 19; Mitchell 2006/2007). It arose from a ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...

Minimal surfaces are defined as surfaces with zero mean curvature. A minimal surface parametrized as x=(u,v,h(u,v)) therefore satisfies Lagrange's equation, ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...

A number that is "close" to (but not equal to) zero may be called an almost zero. In contrast, a number or expression that is equal to zero is said to be identically zero. ...