The automorphism group of projective norm graphs

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án number of complete bipartite graphs K t , s with s > ( t - 1 ) ! . In this note we deepen their understanding further by...

Full description

Saved in:
Bibliographic Details
Published in:Applicable algebra in engineering, communication and computing communication and computing, 2024-11, Vol.35 (6), p.875-886
Main Authors: Bayer, Tomas, Mészáros, Tamás, Rónyai, Lajos, Szabó, Tibor
Format: Article
Language:English
Subjects:
Artificial Intelligence
Automorphisms
Combinatorial analysis
Computer Hardware
Computer Science
Graphs
Original Paper
Symbolic and Algebraic Manipulation
Theory of Computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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án number of complete bipartite graphs K t , s with s > ( t - 1 ) ! . In this note we deepen their understanding further by determining their automorphism group.
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-022-00590-3