RAT-Free Set
A RAT-free (``right angle triangle-free'') set is a set of points, no three of which determine a Right Triangle. Let
be the largest integer such that a RAT-free subset of size is guaranteed to be contained in any set of 
coplanar points. Then the function is bounded by
References
Abbott, H. L. ``On a Conjecture of Erdös and Silverman in Combinatorial Geometry.'' J. Combin. Th. A 29, 380-381, 1980. Chan, W. K. ``On the Largest RAT-FREE Subset of a Finite Set of Points.'' Pi Mu Epsilon 8, 357-367, 1987. Honsberger, R. More Mathematical Morsels. Washington, DC: Math. Assoc. Amer., pp. 250-251, 1991. Seidenberg, A. ``A Simple Proof of a Theorem of Erdös and Szekeres.'' J. London Math. Soc. 34, 352, 1959.
- Gauss's Theorem
- Gauss's Theorema Egregium
- Gauss's Transformation
- Gear Graph
- Gegenbauer Function
- Gegenbauer Polynomial
- Gelfond-Schneider Constant
- Gelfond-Schneider Theorem
- Gelfond's Theorem
- Genaille Rods
- Genera
- Generalized Cone
- Generalized Cylinder
- Generalized Fibonacci Number
- Generalized Function
- Generalized Helicoid
- Generalized Helix
- Generalized Hyperbolic Functions
- Generalized Hypergeometric Function
- Generalized Matrix Inverse
- Generalized Mean
- Generalized Remainder Method
- General Linear Group
- General Orthogonal Group
- General Position