Search Results for ""

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...

An ellipsoidal section is the curve formed by the intersection of a plane with an ellipsoid. An ellipsoidal section is always an ellipse.

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

Almost all natural numbers are very, very, very large (Steinbach 1990, p. 111).

The dual of the stellated truncated hexahedron U_(19) and Wenninger dual W_(92)

Let G denote the group of germs of holomorphic diffeomorphisms of (C,0). Then if |lambda|!=1, then G_lambda is a conjugacy class, i.e., all f in G_lambda are linearizable.

A submodule L of a module M such that for any other nonzero submodule K of M, the intersection L intersection K is not the zero module. L is also called an essential ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...