Search Results for ""

Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

A fullerene is a cubic polyhedral graph having all faces 5- or 6-cycles. Examples include the 20-vertex dodecahedral graph, 24-vertex generalized Petersen graph GP(12,2), ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...

Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

A bicubic nonhamiltonian graph is a bicubic (i.e., bipartite cubic graph) that is nonhamiltonian (i.e., that does not possess a Hamiltonian cycle). Tutte (1971) conjectured ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...