Abstract
A theorem of Baranyai reduces the problem of finding the chromatic index of certain hypergraphs to a cutting stock integer programming problem. Baranyai used this result to establish the chromatic index for the complete h -uniform hypergraphs. We use a linear programming technique of Gomory and Gilmore to extend his result to two other cases: the hereditary closure of the complete h -uniform hypergraphs K h n , for h ≤ 4; and of the complete h -partite hypergraphs.
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.
