The degree d, 1 d n, of the next packet is chosen at random.

For a curve of degree d, the weight of any control point is only nonzero in d+1 intervals of the parameter space.

The edge-connectivity of a vertex-transitive graph is equal to the degree d, while the vertex-connectivity will be at least 2(d+1)/3.

The coefficient of degree d has the value .

If the generator polynomial g has degree d then the rank of the code C is .

The arithmetic genus of a hypersurface of degree d is in .

In particular, a smooth curve of degree d in P has arithmetic genus .

If the polynomial defining the curve has degree d, any line cuts the curve in at most d points.

Suppose G has minimum degree d and girth 2k+1.

Let f be a polynomial of degree d defined over a field K of characteristic zero.