Colourings of star systems

From MaRDI portal



Abstract: An e-star is a complete bipartite graph K1,e. An e-star system of order n>1, Se(n), is a partition of the edges of the complete graph Kn into e-stars. An e-star system is said to be k-colourable if its vertex set can be partitioned into k sets (called colour classes) such that no e-star is monochromatic. The system Se(n) is k-chromatic if Se(n) is k-colourable but is not (k−1)-colourable. If every k-colouring of an e-star system can be obtained from some k-colouring phi by a permutation of the colours, we say that the system is uniquely k-colourable. In this paper, we first show that for any integer kgeq2, there exists a k-chromatic 3-star system of order n for all sufficiently large admissible n. Next, we generalize this result for e-star systems for any egeq3. We show that for all kgeq2 and egeq3, there exists a k-chromatic e-star system of order n for all sufficiently large n such that nequiv0,1 (mod 2e). Finally, we prove that for all kgeq2 and egeq3, there exists a uniquely k-chromatic e-star system of order n for all sufficiently large n such that nequiv0,1 (mod 2e).











This page was built for publication: Colourings of star systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146750)