Graham's Number
The smallest dimension of a Hypercube such that if the lines joining all pairs of corners are two-colored, aPlanar Complete Graph 
of one color will be forced. That an answer exists was proved byR. L. Graham and B. L. Rothschild. The actual answer is believed to be 6, but the best bound proved is
where
is stacked Arrow Notation. It is less than 
, where Chained Arrow Notation hasbeen used.See also Arrow Notation, Chained Arrow Notation, Skewes Number
References
Conway, J. H. and Guy, R. K. The Book of Numbers. New York: Springer-Verlag, pp. 61-62, 1996. Gardner, M. ``Mathematical Games.'' Sci. Amer. 237, 18-28, Nov. 1977.
- Great Dodecicosacron
- Great Dodecicosahedron
- Great Dodecicosidodecahedron
- Greater
- Greater Than/Less Than Symbol
- Greatest Common Denominator
- Greatest Common Divisor
- Greatest Common Divisor Theorem
- Greatest Common Factor
- Greatest Integer Function
- Greatest Lower Bound
- Greatest Prime Factor
- Great Hexacronic Icositetrahedron
- Great Hexagonal Hexecontahedron
- Great Icosacronic Hexecontahedron
- Great Icosahedron
- Great Icosahedron-Great Stellated Dodecahedron Compound
- Great Icosicosidodecahedron
- Great Icosidodecahedron
- Great Icosihemidodecacron
- Great Icosihemidodecahedron
- Great Inverted Pentagonal Hexecontahedron
- Great Inverted Retrosnub Icosidodecahedron
- Great Inverted Snub Icosidodecahedron
- Great Pentagonal Hexecontahedron