Dyer, M, Frieze, A and Greenhill, C (2015) On the chromatic number of a random hypergraph. Journal of Combinatorial Theory, Series B, 113. pp. 68-122. ISSN 0095-8956
Abstract
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, where k, r, c remain constant as n→∞. Achlioptas and Naor showed that the chromatic number of a random graph in this setting, the case r=2, must have one of two easily computable values as n→∞. We give a complete generalisation of this result to random uniform hypergraphs.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2015 Elsevier Inc. This is an author produced version of a paper published in Journal of Combinatorial Theory, Series B. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Hypergraph; Colouring; Chromatic number; Uniform hypergraph; Random hypergraph |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 04 Oct 2016 11:02 |
Last Modified: | 17 Jan 2018 15:25 |
Published Version: | http://dx.doi.org/10.1016/j.jctb.2015.01.002 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.jctb.2015.01.002 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89267 |