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.
- Small Icosihemidodecacron
- Small Icosihemidodecahedron
- Small Inverted Retrosnub Icosicosidodecahedron
- Axial Vector
- Axiom
- Axiom A Diffeomorphism
- Axiom A Flow
- Axiomatic Set Theory
- Axiomatic System
- Axiom of Choice
- Axis
- Ax-Kochen Isomorphism Theorem
- B2-Sequence
- Baby Monster Group
- BAC-CAB Identity
- BAC-CAB Rule
- Bachelier Function
- Bachet Equation
- Bachet's Conjecture
- Backhouse's Constant
- Backtracking
- Backus-Gilbert Method
- Backward Difference
- Bader-Deuflhard Method
- Baguenaudier