Skip to main content
Article thumbnail
Location of Repository

Thresholds and the structure of sparse random graphs

By N. Fountoulakis


In this thesis, we obtain approximations to the non-3-colourability threshold of sparse random graphs and we investigate the structure of random graphs near the region where the transition from 3-colourability to non-3-colourability seems to occur. It has been observed that, as for many other properties, the property of non-3-colourability of graphs exhibits a sharp threshold behaviour. It is conjectured that there exists a critical average degree such that when the average degree of a random graph is around this value the probability of the random graph being non-3-colourable changes rapidly from near 0 to near 1. The difficulty in calculating the critical value arises because the number of proper 3-colourings of a random graph is not concentrated: there is a `jackpot' effect. In order to reduce this effect, we focus on a sub-family of proper 3-colourings, which are called rigid 3-colourings. We give precise estimates for their expected number and we deduce that when the average degree of a random graph is bigger than 5, then the graph is asymptotically almost surely not 3-colourable. After that, we investigate the non-$k$-colourability of random regular graphs for any $k \geq 3$. Using a first moment argument, for each $k \geq 3$ we provide a bound so that whenever the degree of the random regular graph is bigger than this, then the random regular graph is asymptotically almost surely not $k$-colourable. Moreover, in a (failed!) attempt to show that almost all 5-regular graphs are not 3-colourable, we analyse the expected number of rigid 3-colourings of a random 5-regular graph. Motivated by the fact that the transition from 3-colourability to non-3-colourability occurs inside the subgraph of the random graph that is called the 3-core, we investigate the structure of this subgraph after its appearance. Indeed, we do this for the $k$-core, for any $k \geq 2$; and by extending existing techniques we obtain the asymptotic behaviour of the proportion of vertices of each fixed degree. Finally, we apply these results in order to obtain a more clear view of the structure of the 2-core (or simply the core) of a random graph after the emergence of its giant component. We determine the asymptotic distributions of the numbers of isolated cycles in the core as well as of those cycles that are not isolated there having any fixed length. Then we focus on its giant component, and in particular we give the asymptotic distributions of the numbers of 2-vertex and 2-edge-connected components

Topics: Combinatorics
Year: 2003
OAI identifier:

Suggested articles


  1. (1997). A general upper bound for the satisfiability threshold of random r-sat formulae.
  2. (1965). A new method of constrained optimisation and a comparison with other methods.
  3. (2000). A note on the non-colourability threshold of a random graph.
  4. (1999). A sharp threshold for k-colourability.
  5. (2002). Almost all graphs of average degree 4 are
  6. (1991). Almost all graphs with 1.44n edges are 3-colourable.
  7. (1999). Almost all graphs with 2.522n edges are not 3-colorable.
  8. (1998). An improved upper bound on the non-3-colourability threshold. Information Processing Letters,
  9. (1971). An Introduction to Probability Theory and Its Applications,
  10. (1998). Approximating the unsatisfiability threshold of random formulas.
  11. (1991). Asymptotic enumeration by degree sequence of graphs with degrees o(n1/2).
  12. (1984). Basic Optimisation Methods.
  13. (1989). Codes and Cryptography. doi
  14. (1990). Component behavior near the critical point of the random graph process.
  15. (1994). Convexity.
  16. (2000). Corrigendum to “A note on the non-colourability threshold of a random graph”.
  17. Cycles and unicyclic components in random graphs.
  18. (1991). Cycles in random graphs near the critical point.
  19. (1960). On the evolution of random graphs.
  20. (1992). On the independence and chromatic numbers of random regular graphs.
  21. On the non-3-colourability of random graphs.
  22. (2000). On the upper bound of the non-3-colourability threshold of random graphs.
  23. (2001). Random Graphs.
  24. (1999). Sharp thresholds for graph properties, and the k-sat problem.
  25. (1991). Size and connectivity of the k-core of a random graph.
  26. (1992). Sparse random graphs with a given degree sequence.
  27. (1997). The analysis of a list-colouring algorithm on a random graph.
  28. (1993). The birth of the giant component.
  29. (1994). The hardest constrained problems: a double phase transition.
  30. (1992). The Probabilistic Method.
  31. (1986). Threshold functions.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.