  We show that the subgraph induced in Young's graph by the set of partitions
with an odd number of standard Young tableaux is a binary tree. This tree
exhibits self-similarities at all scales, and has a simple recursive
description.
