Author:
Achlioptas Dimitris,Molloy Michael
Abstract
We prove that for $c \geq 2.522$ a random graph with $n$ vertices and $m=cn$ edges is not 3-colorable with probability $1-o(1)$. Similar bounds for non-$k$-colorability are given for $k>3$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm;Journal of Global Optimization;2020-01-13
2. Chromatic transitions in the emergence of syntax networks;Royal Society Open Science;2018-12
3. Estimating satisfiability;Discrete Applied Mathematics;2012-01
4. Tight Bounds on the Threshold for Permuted k-Colorability;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012
5. References;Random Graphs;2011-10-07