Reduced graph of a regularity partition

Given a regularity partition and a density cutoff $\delta$, its reduced graph has one vertex for each nonexceptional class and joins two classes when their pair is regular and has density at least $\delta$.