Chromatic-number conjecture for derived STS of SQS(n), n congruent to 2 modulo 6
Chromatic-number conjecture for derived STS of SQS(n), n congruent to 2 modulo 6
Let an SQS be a Steiner quadruple system on 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 , let denote the minimum number of partial parallel classes needed to partition its blocks.
Chromatic-number conjecture for derived STS. If
then there is an SQS such that all its derived STS have chromatic number , equivalently, each can be partitioned into partial parallel classes. Equivalently,
The conjecture is a design-theoretic existence statement intended to determine the alphabet-size parameter . 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
Sign in to submit a solution.
No solutions have been posted yet.