Search Results for ""

A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).

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

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

There are two different definitions of the mid-arc points. The mid-arc points M_(AB), M_(AC), and M_(BC) of a triangle DeltaABC as defined by Johnson (1929) are the points on ...

The mid-arc triangle is the triangle DeltaA^'B^'C^' whose vertices consist of the intersections of the internal angle bisectors with the incircle, where the points of ...

The midcircle of two given circles is the circle which would invert the circles into each other. Dixon (1991) gives constructions for the midcircle for four of the five ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...