Ilya Scheidwasser → Northeastern University.
Capstone thesis contains some
combinatorial information about hypertrees not covered in .
Ilya's C++ program found all hypertrees with
(note that irreducible hypertrees are called "strong hypergraphs" in Ilya's thesis).
Nate Harman→ MIT.
Most of Nate's REU results were incorporated in .
Nicky Reyes → UT Austin.
Nicky's experiments helped a great deal to classify extremal P-resolutions in Section 4 of .