English

Colouring problems for symmetric configurations with block size 3

Combinatorics 2021-03-23 v2

Abstract

The study of symmetric configurations v3v_3 with block size 3 has a long and rich history. In this paper we consider two colouring problems which arise naturally in the study of these structures. The first of these is weak colouring, in which no block is monochromatic; the second is strong colouring, in which every block is multichromatic. The former has been studied before in relation to blocking sets. Results are proved on the possible sizes of blocking sets and we begin the investigation of strong colourings. We also show that the known 21321_3 and 22322_3 configurations without a blocking set are unique and make a complete enumeration of all non-isomorphic 20320_3 configurations. We discuss the concept of connectivity in relation to symmetric configurations and complete the determination of the spectrum of 2-connected symmetric configurations without a blocking set. A number of open problems are presented.

Keywords

Cite

@article{arxiv.2004.04514,
  title  = {Colouring problems for symmetric configurations with block size 3},
  author = {Grahame Erskine and Terry Griggs and Jozef Širáň},
  journal= {arXiv preprint arXiv:2004.04514},
  year   = {2021}
}

Comments

23 pages, 3 figures. Updated to reference previous results on blocking sets

R2 v1 2026-06-23T14:45:30.994Z