Search Results for ""

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 points known as Kirkman points. Each ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The Kuen surface is a special case of Enneper's negative curvature surfaces which can be given parametrically by x = (2(cosu+usinu)sinv)/(1+u^2sin^2v) (1) = ...

A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...

Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...

Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...