  In this note, we provide a proof of a technical result of Erd\H{o}s and
Hajnal about the existence of disjoint type graphs with no odd cycles. We also
prove that this result is sharp in a certain sense.
