Search Results for ""

An elementary theorem in geometry whose name means "asses' bridge," perhaps in reference to the fact that fools would be unable to pass this point in their geometric studies. ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

A type of number involving the roots of unity which was developed by Kummer while trying to solve Fermat's last theorem. Although factorization over the integers is unique ...

A prize of 100000 German marks offered for the first valid proof of Fermat's last theorem (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199). The ...

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

Find an analytic parameterization of the compact Riemann surfaces in a fixed homeomorphism class. The Ahlfors-Bers theorem proved that Riemann's moduli space gives the ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

A "pointwise-bounded" family of continuous linear operators from a Banach space to a normed space is "uniformly bounded." Symbolically, if sup||T_i(x)|| is finite for each x ...