scientific article; zbMATH DE number 1919507

zbMath1012.05142MaRDI QIDQ4483917

Nikolaos Fountoulakis, Colin J. H. McDiarmid

Publication date: 27 May 2003

Full work available at URL: https://eudml.org/doc/122637

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

thresholds3-colourabilitysparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Upper-bounding the \(k\)-colorability threshold by counting covers ⋮ When does the giant component bring unsatisfiability?

This page was built for publication: