We define n-partition-dominating sets and prove their existence under precise cardinality hypotheses. We establish density, comeager properties, filter generation, and forcing preservation. Finally, we show that selector sets in the Hausdorff and Banach–Tarski paradoxes contain partition-dominating subsets, revealing a unified combinatorial structure.

Renamed from "Half-Dense Sets" for clarity. Pure ZFC proofs; no data.