Abstract
It is well known that a Steiner triple system (STS) on v points, an STS ( v ) , can be seen as a collection of 3-subsets of its point set, called triples, such that each pair of points occurs in exactly one triple as well as a decomposition of a complete graph on v vertices into cycles of length 3. By combining those two views on STSs we develop a method for its weak coloring. This method enables us to show that each STS ( 25 ) is 4-colorable, which in turn implies that the chromatic spectrum of STS ( 25 ) is { 3 , 4 } ˙ .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
