Concept
Steiner triple system
A set of points together with triples of them, arranged so that every pair of points lies in exactly one triple. One exists precisely when the number of points leaves remainder one or three on division by six, which is what two divisions coming out whole requires and is also, unusually, enough.
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A schedule where every pair meets once
Sort n people into groups of three so that every two of them share a group exactly once. Two divisions have to come out whole, that rules out most sizes — and at every size the divisions permit, a schedule exists.
More blocks than points
A schedule in which every pair meets once cannot use fewer groups than it has people. Nothing about the counting conditions says so, and the proof is not combinatorial at all — it is a determinant, computed over a field the schedules have nothing to do with.
Named alongside it
The objects these essays reach for when they reach for this one.
Block designCounting argumentExistence proofIncidenceProjective planeDivisibilityFano planeRank