Search Results for ""

A check which can be used to verify correct computations in a table of grouped classes. For example, consider the following table with specified class limits and frequencies ...

A way to display n variables on a two-dimensional surface. For instance, let x be eyebrow slant, y be eye size, z be nose length, etc. The above figures show faces produced ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

The Christmas stocking theorem, also known as the hockey stick theorem, states that the sum of a diagonal string of numbers in Pascal's triangle starting at the nth entry ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...