Search Results for ""

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

The 7.1.2 equation A^7+B^7=C^7 (1) is a special case of Fermat's last theorem with n=7, and so has no solution. No solutions to the 7.1.3, 7.1.4, 7.1.5, 7.1.6 equations are ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

There are two different definitions of generalized Fermat numbers, one of which is more general than the other. Ribenboim (1996, pp. 89 and 359-360) defines a generalized ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...