Abstract
Let F be uniform hypergraph. In the present paper I prove that of | F| < n 1 3 42 then the chromatic number of F is equal to 2. I have a result in the general (not necessarily uniform) case too.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.