Strongly regular configurations
Combinatorics
2025-09-30 v2
Abstract
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed. Necessary existence conditions are proved and a table of feasible parameters of such configurations with at most 200 points is presented. Non-existence of some configurations with feasible parameters is proved.
Cite
@article{arxiv.2104.04880,
title = {Strongly regular configurations},
author = {Marién Abreu and Martin Funk and Vedran Krčadinac and Domenico Labbate},
journal= {arXiv preprint arXiv:2104.04880},
year = {2025}
}
Comments
23 pages, 1 figure. Revision: added Proposition 5.6 and made some minor corrections