Search Results for ""

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...

The branch of mathematics which does not involve infinite sets, limits, or continuity.

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

Given a marked point process Phi of the form Phi=(T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)), the space Y=(Y_n)_(n>=1) is said to be the mark space of Phi.

If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.