Jan Corsten

Sparsification Preserves Triangle Factors at Tight Threshold

A regularity-and-entropy proof shows dense graphs with minimum degree 2n/3 keep triangle factors when p ≥ C(log n)^(1/3)n^(-2/3).