Monochromatic Forced Triangle
Given a Complete Graph 
which is two-colored, the number of forced monochromatic Triangles is at least
The first few numbers of monochromatic forced triangles are 0, 0, 0, 0, 0, 2, 4, 8, 12, 20, 28, 40, ... (Sloane's A014557).See also Complete Graph, Extremal Graph
References
Goodman, A. W. ``On Sets of Acquaintances and Strangers at Any Party.'' Amer. Math. Monthly 66, 778-783, 1959. Sloane, N. J. A. Sequence A014557in ``The On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html.
- d'Alembert's Equation
- d'Alembert's Solution
- d'Alembert's Theorem
- Damped Exponential Cosine Integral
- d-Analog
- Dandelin Spheres
- Danielson-Lanczos Lemma
- Darboux Integral
- Darboux-Stieltjes Integral
- Darboux Vector
- Darling's Products
- Dart
- Darwin-de Sitter Spheroid
- Darwin's Expansions
- Database
- Data Structure
- Daubechies Wavelet Filter
- Davenport-Schinzel Sequence
- Dawson's Integral
- Day of Week
- de Bruijn Constant
- de Bruijn Diagram
- de Bruijn Graph
- de Bruijn-Newman Constant
- de Bruijn Sequence