Colourings of star systems
From MaRDI portal
Abstract: An -star is a complete bipartite graph . An -star system of order , , is a partition of the edges of the complete graph into -stars. An -star system is said to be -colourable if its vertex set can be partitioned into sets (called colour classes) such that no -star is monochromatic. The system is -chromatic if is -colourable but is not -colourable. If every -colouring of an -star system can be obtained from some -colouring by a permutation of the colours, we say that the system is uniquely -colourable. In this paper, we first show that for any integer , there exists a -chromatic 3-star system of order for all sufficiently large admissible . Next, we generalize this result for -star systems for any . We show that for all and , there exists a -chromatic -star system of order for all sufficiently large such that (mod ). Finally, we prove that for all and , there exists a uniquely -chromatic -star system of order for all sufficiently large such that (mod ).
Recommendations
Cites work
- Coloring Steiner Triple Systems
- Colouring even cycle systems
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- On claw-decomposition of complete graphs and complete bigraphs
- On cycle systems with specified weak chromatic number
- On tree factorizations of Kn
- Uniquely 3-colourable Steiner triple systems
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)