On the Upper and Lower Chromatic Numbers of BSQSs(16)

A mixed hypergraph is characterized by the fact that it possesses ${\cal C}$-edges as well as ${\cal D}$-edges. In a colouring of a mixed hypergraph, every ${\cal C}$-edge has at least two vertices of the same colour and every ${\cal D}$-edge has at least two vertices coloured differently. The upper and lower chromatic numbers $\bar{\chi}$, $\chi$ are the maximum and minimum numbers of colours for which there exists a colouring using all the colours. The concepts of mixed hypergraph, upper and lower chromatic numbers are applied to $SQSs$. In fact a BSQS is an SQS where all the blocks are at the same time ${\cal C}$-edges and ${\cal D}$-edges. In this paper we prove that any $BSQS(16)$ is colourable with the upper chromatic number $\bar{\chi}=3$ and we give new information about the chromatic spectrum of BSQSs($16$).

[1]  Zsolt Tuza,et al.  Chromatic spectrum is broken , 1999, Electron. Notes Discret. Math..

[2]  Zsolt Tuza,et al.  Upper chromatic number of Steiner triple and quadruple systems , 1997, Discret. Math..

[3]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .

[4]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[5]  Haim Hanani,et al.  On Quadruple Systems , 1960, Canadian Journal of Mathematics.

[6]  Giovanni Lo Faro,et al.  2-Colourings in S(t, t + 1, v) , 1993, Discret. Math..

[7]  Vitaly I. Voloshin,et al.  On the upper chromatic number of a hypergraph , 1995, Australas. J Comb..

[8]  Lorenzo Milazzo On upper chromatic number for SQS(10) and SQS(16) , 1995 .

[9]  Vitaly I. Voloshin,et al.  The mixed hypergraphs , 1993, Comput. Sci. J. Moldova.