Search Results for ""

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...

The Heaviside step function is a mathematical function denoted H(x), or sometimes theta(x) or u(x) (Abramowitz and Stegun 1972, p. 1020), and also known as the "unit step ...

The heptanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, H_6=16, and the recurrence relation ...

The hexanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, and the recurrence relation ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The Kampé de Fériet function is a special function that generalizes the generalized hypergeometric function to two variables and includes the Appell hypergeometric function ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...