Search Results for ""

The central point in a wheel graph W_n. The hub has degree n-1.

A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...

An algebraically soluble equation of odd prime degree which is irreducible in the natural field possesses either 1. Only a single real root, or 2. All real roots.

A graph for which every node has finite degree.

Let rho(x) be an mth degree polynomial which is nonnegative in [-1,1]. Then rho(x) can be represented in the form {[A(x)]^2+(1-x^2)[B(x)]^2 for m even; ...

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

The Maclaurin-Bézout theorem says that two curves of degree n intersect in n^2 points, so two cubics intersect in nine points. This means that n(n+3)/2 points do not always ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

Let R be a number ring of degree n with 2s imaginary embeddings. Then every ideal class of R contains an ideal J such that ||J||<=(n!)/(n^n)(4/pi)^ssqrt(|disc(R)|), where ...