- This page was last edited on 7 July 2018, at 03:16.
- Content is available under Attribution-NonCommercial-ShareAlike 3.0 Unported unless otherwise noted.
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.
