Blue-Empty Graph
An Extremal Graph in which the forced Triangles are all the same color. Call 
the number ofred Monochromatic Forced Triangles and 
the number of blueMonochromatic Forced Triangles, then a blue-empty graph is an ExtremalGraph with 
. For Even 
, a blue-empty graph can be achieved by coloring red two CompleteSubgraphs of 
points (the Red Net method). There is no blue-empty coloring for Odd except for 
(Lorden 1962).
References
Lorden, G. ``Blue-Empty Chromatic Graphs.'' Amer. Math. Monthly 69, 114-120, 1962. Sauvé, L. ``On Chromatic Graphs.'' Amer. Math. Monthly 68, 107-111, 1961.
- Natural Invariant
- Natural Logarithm
- Natural Measure
- Natural Norm
- Natural Number
- Naught
- Navigation Problem
- N-Cluster
- n-Cube
- Nearest Integer Function
- Nearest Neighbor Problem
- Near-Integer
- Near Noble Number
- Near-Pencil
- Necessary
- Necker Cube
- Necklace
- Needle
- Negation
- Negative
- Negative Binomial Distribution
- Negative Binomial Series
- Negative Integer
- Negative Likelihood Ratio
- Negative Pedal Curve