How much independence is required for separate chaining?
Apparently not. "Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence", by  Mathias Bæk Tejs Knudsen and Morten Stöckel shows "a $k$-independent family of functions that imply [heaviest loaded bin] size $\Omega(n^{1/k})$".