the extremal 16-point set (the Clebsch graph) in R⁵, rotating rigidly. red: the 80 pairs at distance exactly 1. among any three points, some two are red · so no triple is ever empty. this set gives f(5) ≥ 16; the matching upper bound (no 17-point set) is proved separately.