Search Results for ""

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 ...

A well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...

A multilinear form on a vector space V(F) over a field F is a map f:V(F)×...×V(F)->F (1) such that c·f(u_1,...,u_i,...,u_n)=f(u_1,...,c·u_i,...,u_n) (2) and ...

A nonuniform rational B-spline surface of degree (p,q) is defined by ...

An algebraic surface of degree eight. The maximum number of ordinary double points known to exist on an octic surface is 168 (the Endraß octics), although the rigorous upper ...

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