Abstract
The paper deals with the study of the limit distribution of the \(j\)-chromatic numbers of a random k-uniform hypergraph in the binomial model \(H(n,k,p)\). We consider the sparse case when the expected number of edges is a linear function of the number of vertices \(n\), i.e. is equal to \(cn\) for \(c 0\) not depending on \(n\). We prove that for all large enough values of \(c\), the \(j\)-chromatic number of \(H(n,k,p)\) is concentrated in one or two consecutive numbers with probability tending to 1.
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 callMore From: Доклады Российской академии наук. Математика, информатика, процессы управления
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.
