Bayer, T and Mészáros, T and Rónyai, Lajos and Szabó, T (2024) The automorphism group of projective norm graphs. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 35. pp. 875-886. ISSN 0938-1279 10.1007/s00200-022-00590-3

Text Bayer_875_33645181_ny.pdf Download (1MB)

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	LOWER BOUNDS; Finite fields; Ramsey numbers; Subgraphs; Computer Science, Interdisciplinary Applications; Computer Science, Theory & Methods; Turan problems; Norm graphs; Norm equations;
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Informatics Laboratory
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	17 Oct 2024 08:14
Last Modified:	17 Oct 2024 08:14
URI:	https://eprints.sztaki.hu/id/eprint/10796

Update Item