On the chromatic number of a random hypergraph
- Submitting institution
-
The University of Leeds
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- UOA11-95
- Type
- D - Journal article
- DOI
-
10.1016/j.jctb.2015.01.002
- Title of journal
- Journal of Combinatorial Theory, Series B
- Article number
- -
- First page
- 68
- Volume
- 113
- Issue
- -
- ISSN
- 0095-8956
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - AC (Algorithms and Complexity)
- Citation count
- 18
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Random graphs and hypergraphs are useful models of “typical” problems in Computer Science. This paper extended a ten-year old result of Achlioptas and Naor (2005) on colouring random graphs to colouring random hypergraphs. The Achlioptas-Naor result had been considered difficult, and hence received publication in a leading general Mathematics journal (Annals of Mathematics). By contrast, this paper gave a clean (and relatively elegant) proof, which not only includes the Achlioptas-Naor result, but also work of Achlioptas and Moore (2006) on random satisfiability. The results were marginally improved by Ayre, Coja-Oghlan and Greenhill (2018).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
