On the non-3-colourability of random graphs
classification
🧮 math.CO
keywords
randomalmostbestboundcolouringcurrentedgesgraph
read the original abstract
We show that for c >= 2.4682, a random graph on n vertices with c n (1+o(1)) edges almost surely has no 3-colouring. This improves on the current best upper bound of 2.4947.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.