Search Results for ""

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).

The quintic equation x^5+ax^3+1/5a^2x+b=0 (1) is sometimes known as de Moivre's quintic (Spearman and Williams 1994). It has solutions x_j=omega^ju_1+omega^(4j)u_2 (2) for ...

For every proposition involving logical addition and multiplication ("or" and "and"), there is a corresponding proposition in which the words "addition" and "multiplication" ...

A method for constructing magic squares of odd order, also called the Siamese method.

If W is a simply connected, compact manifold with a boundary that has two components, M_1 and M_2, such that inclusion of each is a homotopy equivalence, then W is ...

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.