Search Results for ""

If f is continuous on a closed interval [a,b], and c is any number between f(a) and f(b) inclusive, then there is at least one number x in the closed interval such that ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

The rank of a matrix or a linear transformation is the dimension of the image of the matrix or the linear transformation, corresponding to the number of linearly independent ...

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

The maximal number of regions into which n lines divide a plane are N(n)=1/2(n^2+n+2) which, for n=1, 2, ... gives 2, 4, 7, 11, 16, 22, ... (OEIS A000124), the same maximal ...

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

The number of real roots of an algebraic equation with real coefficients whose real roots are simple over an interval, the endpoints of which are not roots, is equal to the ...