Search Results for ""

A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

The unknotting number for a torus knot (p,q) is (p-1)(q-1)/2. This 40-year-old conjecture was proved (Adams 1994) by Kronheimer and Mrowka (1993, 1995).

A Banach space X is called minimal if every infinite-dimensional subspace Y of X contains a subspace Z isomorphic to X. An example of a minimal Banach space is the Banach ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...

For a triangle DeltaABC and three points A^', B^', and C^', one on each of its sides, the three Miquel circles are the circles passing through each polygon vertex and its ...