Search Results for ""

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

Fermat's spiral, also known as the parabolic spiral, is an Archimedean spiral with m=2 having polar equation r^2=a^2theta. (1) This curve was discussed by Fermat in 1636 ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

Four-dimensional geometry is Euclidean geometry extended into one additional dimension. The prefix "hyper-" is usually used to refer to the four- (and higher-) dimensional ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

A board covered by a lattice of pegs around which one can span rubber bands to form segments and polygons. It was invented by the Egyptian mathematician and pedagogist Caleb ...

The Gergonne point Ge is the perspector of a triangle DeltaABC and its contact triangle DeltaT_AT_BT_C. It has equivalent triangle center functions alpha = [a(b+c-a)]^(-1) ...

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...