A parallel between the descriptive complexities of finite groups and Latin square graphs

MaRDI QIDQ6949758zbMATH OpenFDO

Authors Anuj Dawar, Danny Vagnozzi

Publication date 1 August 2025

zbMATH Keywords

orthogonal matrixstrongly regular graphs

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graph designs and isomorphic decomposition (05C51) Association schemes, strongly regular graphs (05E30)

This page was built for publication: A parallel between the descriptive complexities of finite groups and Latin square graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949758)