A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...