Search Results for ""

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...

The smallest composite squarefree number (2·3), and the third triangular number (3(3+1)/2). It is the also smallest perfect number, since 6=1+2+3. The number 6 arises in ...

The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

The points of tangency t_1 and t_2 for the four lines tangent to two circles with centers x_1 and x_2 and radii r_1 and r_2 are given by solving the simultaneous equations ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...