Search Results for ""

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...