Tutte's Theorem
Let 
be a Graph and 
a Subgraph of . Let the number of Odd components in 
be denoted 
, and 
the number of Vertices of . The condition 
for everySubset of Vertices is Necessary and Sufficient for to have a1-Factor.
References
Honsberger, R. ``Lovász' Proof of a Theorem of Tutte.'' Ch. 14 in Mathematical Gems II. Washington, DC: Math. Assoc. Amer., pp. 147-157, 1976. Tutte, W. T. ``The Factorization of Linear Graphs.'' J. London Math. Soc. 22, 107-111, 1947.
- Jung's Theorem
- Just If
- Just One
- Kabon Triangles
- Kac Formula
- Kac Matrix
- Kakeya Needle Problem
- Kakutani's Fixed Point Theorem
- Kakutani's Problem
- Kalman Filter
- Kampyle of Eudoxus
- KAM Theorem
- Kanizsa Triangle
- Kantorovich Inequality
- Kaplan-Yorke Conjecture
- Kaplan-Yorke Dimension
- Kaplan-Yorke Map
- Kappa Curve
- Kaprekar Number
- Kaprekar Routine
- Kaps-Rentrop Methods
- Kapteyn Series
- Karatsuba Multiplication
- k-ary Divisor
- Katona's Problem