Search Results for ""

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...

A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

Twenty golfers wish to play in foursomes for 5 days. Is it possible for each golfer to play no more than once with any other golfer? The answer is yes, and the following ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.