Abstract
AbstractThe 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án number of complete bipartite graphs $$K_{t,s}$$ K t , s with $$s>(t-1)!$$ s > ( t - 1 ) ! . In this note we deepen their understanding further by determining their automorphism group.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have