We call a system of non-empty sets H entwined, if for every disjoint pair of sets A and B in H there exists b∈B such that A∪{b} is in H or there exists a∈A such that B∪{a} is in H.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.