Almost all graphs with average degree 4 are 3-colorable

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 199-208

  Achlioptas, Dimitris ^a   Moore, Cristopher ^a  

^a NONE

Author keywords

Graph coloring; Random graphs; Threshold phenomena

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DIFFERENTIAL EQUATIONS; FUNCTIONS; HEURISTIC METHODS; MARKOV PROCESSES; PROBABILITY; STATISTICAL METHODS;

AVERAGE-CASE ANALYSIS; BRELAZ HEURISTIC; COLORING SPARSE RANDOM GRAPHS;

GRAPH THEORY;

EID: 0036036698     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509939.509940     Document Type: Conference Paper

References (23)

1. Setting two variables at a time yields a new lower bound for random 3-SAT
2. A sharp threshold for k-colorability
3. The analysis of a list-coloring algorithm on a random graph
4. The asymptotic number of labelled graphs with given degree sequences
5. Optimization with extremal dynamics
6. New methods to color the vertices of a graph
7. On the evolution of random graphs
8. Analysis of two simple heuristics on a random instance of k-SAT
9. A note on the non-colorability threshold of a random graph
10. Maximum matchings in sparse random graphs
11. Solutions of ordinary differential equations as limits of pure jump Markov processes
12. Approximation of population processes
13. Studying balanced allocations with differential equations
14. Analyses of load stealing models based on families of differential equations
15. A critical point for random graphs with a given degree sequence
16. Sudden emergence of a giant k-core in a random graph
17. Differential equations for random processes and random graphs