Harnack's Theorems
Harnack's first theorem states that a real irreducible curve of order 
cannot have more than
circuits (Coolidge 1959, p. 57).
Harnack's second theorem states that there exists a curve of every order with the maximum number of circuits compatible withthat order and with a certain number of double points, provided that number is not permissible for a curve of lower order(Coolidge 1959, p. 61).
References
Coolidge, J. L. A Treatise on Algebraic Plane Curves. New York: Dover, 1959.
- Gram-Schmidt Orthonormalization
- Gram Series
- Gram's Inequality
- Granny Knot
- Graph (Function)
- Graph (Graph Theory)
- Graphical Partition
- Graph Theory
- Graph Two-Coloring
- Grassmann Algebra
- Grassmann Coordinates
- Grassmann Manifold
- Gray Code
- Great Circle
- Great Cubicuboctahedron
- Great Deltoidal Hexecontahedron
- Great Deltoidal Icositetrahedron
- Great Dirhombicosidodecacron
- Great Dirhombicosidodecahedron
- Great Disdyakis Dodecahedron
- Great Disdyakis Triacontahedron
- Great Ditrigonal Dodecacronic Hexecontahedron
- Great Ditrigonal Dodecicosidodecahedron
- Great Ditrigonal Icosidodecahedron
- Great Dodecacronic Hexecontahedron