Search Results for ""

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...

A k-subset is a subset of a set on n elements containing exactly k elements. The number of k-subsets on n elements is therefore given by the binomial coefficient (n; k). For ...

Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A branch of game theory dealing with strategies to maximize the outcome of a given process in the face of uncertain conditions.

A diminished polyhedron is a polyhedron in which one or more groups of associated faces (such as those comprising the top of a pyramid or cupola in the case of a Johnson ...

An n×n matrix A is an elementary matrix if it differs from the n×n identity I_n by a single elementary row or column operation.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.