Abstract
Ak-colouring of a hypergraph is an assignment of no more thank colours to the vertices of the hypergraph in such a way that the coloured hypergraph has no monochromatic edges. In this paper a polymatroid is associated with a hypergraph. It is shown that the number ofk-colourings of the hypergraph is determined by an evaluation of the characteristic polynomial of this polymatroid. Hypergraph colouring is then related to an extension of the critical problem developed by the author. It is shown that, ifq is a prime power, then a hypergraph isq k -colourable if and only if the critical exponent overGF(q) of its associated polymatroid is less than or equal tok.
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.
