Search Results for ""

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 Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

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

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

The Euclidean metric is the function d:R^n×R^n->R that assigns to any two vectors in Euclidean n-space x=(x_1,...,x_n) and y=(y_1,...,y_n) the number ...