Colouring 4-cycle systems with equitably coloured blocks (Q1876682)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Colouring 4-cycle systems with equitably coloured blocks |
scientific article |
Statements
Colouring 4-cycle systems with equitably coloured blocks (English)
0 references
20 August 2004
0 references
An \(m\)-colouring of a 4-cycle system of order \(n\) (i.e., of a decomposition of the complete graph \(K_n\) into 4-cycles) is a colouring of the vertices with \(m\) colours; it is equitable if for every 4-cycle two of the four vertices are coloured with one colour, and the other two with another one of the \(m\) colours. The authors investigate the set \(F(n)\) of integers \(m\) such that there exists an equitably \(m\)-coloured 4-cycle system of order \(n\). They show that \(\min F(n)=3\) for every \(n\equiv 1\pmod 8\), \(n\geq 17\) \([F(9)=\varnothing]\), and prove various further results concerning the set \(F(n)\).
0 references
cycle
0 references
colouring
0 references
chromatic number
0 references
4-cycle systems
0 references
0 references