TITLE: Is there any good survey on the hook length formula and related topics?
QUESTION [8 upvotes]: I am recently doing some research related to the hook length formula.
The hook formula counts the number of Young tableaux of certain type. 
I find there are plenty of research already been done and I can observe a lot extension and generalization of hook length formula types. But is there a good survey on those research and open problems?
What I am interested are those extensions purely combinatorial, but it is still good if anybody can provide some survey on the representation theory side.
Please correct me if there are easy-to-find survey or the problem is too general for asking.

REPLY [5 votes]: Some references you might find interesting:
Proctor classify certain posets (d-complete posets), that admit hook formulas. There are hook formulas for forests, as well as some other types. (Victor Reiner, P-partitions revisited, Triangle Lectures in Combinatorics slides, 2011.)
Also, I believe there is some recent results on hook formulas for skew shapes. (Morales, Pak, Panova, Hook formulas for skew shapes I, 2015.)