Chromatic-number conjecture for derived STS of SQS(n), n congruent to 2 modulo 6

From papers

Let an SQS(n)(n) be a Steiner quadruple system on nn points, and let a derived STS be the Steiner triple system obtained by fixing a point of the SQS and deleting that point from every block containing it. For an STS SS', let χ(S)\chi(S') denote the minimum number of partial parallel classes needed to partition its blocks.

Chromatic-number conjecture for derived STS. If

20n2mod6,20 \le n \equiv 2 \bmod 6,

then there is an SQS(n)(n) such that all its derived STS have chromatic number n/2n/2, equivalently, each can be partitioned into n/2n/2 partial parallel classes. Equivalently,

q0(3,4,n)=n/2+1.q'_0(3,4,n)=n/2+1.

The conjecture is a design-theoretic existence statement intended to determine the alphabet-size parameter q0(3,4,n)q'_0(3,4,n). The supplied source does not report a general proof or refutation.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Minjia Shi, Yuhong Xia and Denis S. Krotov, “A family of diameter perfect constant-weight codes from Steiner systems”, arXiv:2212.00048 (2023).

Solutions 0

No solutions have been posted yet.