Framework
Consider a finite collection of points 
, 
Euclidean Space(known as a Configuration) and a graph 
whose Vertices correspond to pairs of points that are constrainedto stay the same distance apart. Then the graph together with the configuration 
, denoted 
, is calleda framework.
- Kinoshita-Terasaka Mutants
- Kirby Calculus
- Kirby's List
- Kirkman's Schoolgirl Problem
- Kirkman Triple System
- Kissing Circles Problem
- Kissing Number
- Kiss Surface
- Kite
- Klarner-Rado Sequence
- Klarner's Theorem
- Klein-Beltrami Model
- Klein Bottle
- Klein Four-Group
- Klein-Gordon Equation
- Kleinian Group
- Klein Quartic
- Klein's Absolute Invariant
- Klein's Equation
- Klein's Theorem
- Kloosterman's Sum
- k-Matrix
- Knapsack Problem
- Kneser-Sommerfeld Formula
- Knights of the Round Table