The projective norm graphs are central objects to extremal combinatorics. They appear
in a variety of contexts, most importantly they provide tight constructions for the
Tur & aacute;n number of complete bipartite graphs K-t,K-s with s > (t - 1)! . In
this note we deepen their understanding further by determining their automorphism
group.
