Search Results for ""

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

The use of permil (a.k.a. parts per thousand) is a way of expressing ratios in terms of whole numbers. Given a ratio or fraction, it is converted to a permil-age by ...

The use of permil (a.k.a. parts per thousand) is a way of expressing ratios in terms of whole numbers. Given a ratio or fraction, it is converted to a permil-age by ...

A Pythagorean triangle is a right triangle with integer side lengths (i.e., whose side lengths (a,b,c) form a Pythagorean triple). A Pythagorean triangle with GCD(a,b,c)=1 is ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

An SIR model is an epidemiological model that computes the theoretical number of people infected with a contagious illness in a closed population over time. The name of this ...

A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.