In mathematics, Bondy's theorem is a bound on the number of elements needed to distinguish the sets in a family of sets from each other. It belongs to the field of combinatorics, and is named after John Adrian Bondy, who published it in 1972.[1]
- ^ Bondy, J. A. (1972), "Induced subsets", Journal of Combinatorial Theory, Series B, 12 (2): 201–202, doi:10.1016/0095-8956(72)90025-1, MR 0319773.