Search Results for ""

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

A theorem which treats constructions of fields of field characteristic p.

The second-order ordinary differential equation y^('')+alpha(x)y^'+x^2y^n=0.

A nonempty set is a set containing one or more elements. Any set other than the empty set emptyset is therefore a nonempty set. Nonempty sets are sometimes also called ...

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.

The reciprocity theorem for x^8=q (mod p).

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...

A premise is a statement that is assumed to be true. Formal logic uses a set of premises and syllogisms to arrive at a conclusion.

The positive rational numbers, denoted Q^+.