We investigate the largest number of colours, called upper chromatic number and denoted \bar(\chi)(H), that can be assigned to the vertices (points) of a teiner triple system H in such a way that every block H is an element of H contains at least two vertices of the same colour. The exact value of \bar(\chi) is determined for some classes of triple systems, and it is observed further that optimal colourings with the same number of colours exist also under the additional assumption that no monochromatic block occurs. Examples show, however, that the cardinalities of the colour classes in the latter case are more strictly determined.

### Strict colourings for classes of STS

#### Abstract

We investigate the largest number of colours, called upper chromatic number and denoted \bar(\chi)(H), that can be assigned to the vertices (points) of a teiner triple system H in such a way that every block H is an element of H contains at least two vertices of the same colour. The exact value of \bar(\chi) is determined for some classes of triple systems, and it is observed further that optimal colourings with the same number of colours exist also under the additional assumption that no monochromatic block occurs. Examples show, however, that the cardinalities of the colour classes in the latter case are more strictly determined.
##### Scheda breve Scheda completa Scheda completa (DC)
Steiner triple system; Coloring; Chromatic number
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11769/327
• ND
• 36
• 31