Schwenk's Formula
Let 
be the number of Monochromatic Forced Triangles (where 
and 
are thenumber of red and blue Triangles) in an Extremal Graph. Then
where
is a Binomial Coefficient and 
is the Floor Function (Schwenk 1972).See also Extremal Graph, Monochromatic Forced Triangle
References
Schwenk, A. J. ``Acquaintance Party Problem.'' Amer. Math. Monthly 79, 1113-1117, 1972.
- Isovolume Problem
- Isthmus
- Iterated Exponential Constants
- Iterated Function System
- Iterated Radical
- Iteration Sequence
- Itô's Lemma
- Itô's Theorem
- Iverson Bracket
- Iwasawa's Theorem
- j
- Jackson's Difference Fan
- Jackson's Identity
- Jackson's Theorem
- Jacobi Algorithm
- Jacobian
- Jacobian Conjecture
- Jacobian Curve
- Jacobian Determinant
- Jacobi-Anger Expansion
- Jacobian Group
- Jacobi Differential Equation
- Jacobi Differential Equation (Calculus of Variations)
- Jacobi Elliptic Functions
- Jacobi Function of the First Kind