Search Results for ""

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

Suppose that X^~,X are arcwise-connected and locally arcwise-connected topological spaces. Then (X^~,p) is said to be a covering space of X if p:X^~->X is a surjective ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

Given any assignment of n-element sets to the n^2 locations of a square n×n array, is it always possible to find a partial Latin square? The fact that such a partial Latin ...

Given five equal disks placed symmetrically about a given center, what is the smallest radius r for which the radius of the circular area covered by the five disks is 1? The ...

A system of congruences a_i mod n_i with 1<=i<=k is called a complete residue system (or covering system) if every integer y satisfies y=a_i (mod n) for at least one value of ...