Search Results for ""

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...

The Mercator series, also called the Newton-Mercator series (Havil 2003, p. 33), is the Taylor series for the natural logarithm ln(1+x) = sum_(k=1)^(infty)((-1)^(k+1))/kx^k ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

Three guests decide to stay the night at a lodge whose rate they are initially told is $30 per night. However, after the guests have each paid $10 and gone to their room, the ...

Model theory is a general theory of interpretations of axiomatic set theory. It is the branch of logic studying mathematical structures by considering first-order sentences ...

Modus tollens is a valid argument form in propositional calculus in which p and q are propositions. If p implies q, and q is false, then p is false. Also known as an indirect ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...