Search Results for ""

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any sets a and b of a set x having a and b as its only elements. x is called the unordered pair of a ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

Let A and B be any sets. Then the product of |A| and |B| is defined as the Cartesian product |A|*|B|=|A×B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; Moore 1982, p. 37; ...

Given a set P of primes, a field K is called a class field if it is a maximal normal extension of the rationals which splits all of the primes in P, and if P is the maximal ...

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

A generalization of Turán's theorem to non-complete graphs.

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.