Editing Disjoint sets (section)

{{Short description|Sets with no element in common}}
{{About|the mathematical concept|the data structure|Disjoint-set data structure}}
[[Image:Disjunkte Mengen.svg|thumb|Two disjoint sets]]

In [[set theory]] in [[mathematics]] and [[Logic#Formal logic|formal logic]], two [[Set (mathematics)|sets]] are said to be '''disjoint sets''' if they have no [[element (mathematics)|element]] in common. Equivalently, two disjoint sets are sets whose [[intersection (set theory)|intersection]] is the [[empty set]].<ref name="halmos">{{citation|title=Naive Set Theory|series=[[Undergraduate Texts in Mathematics]]|first=P. R.|last=Halmos|author-link=Paul Halmos|publisher=Springer|year=1960|isbn=9780387900926|page=15|url=https://books.google.com/books?id=x6cZBQ9qtgoC&pg=PA15}}.</ref> For example, {1, 2, 3} and {4, 5, 6} are ''disjoint sets,'' while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint.