Let χ (G (n, p)) denote the chromatic number of the random graph G (n, p). We prove that
there exists a constant d 0 such that for np (n)> d 0, p (n)→ 0, the probability that np 2 log …

The chromatic number of random graphs | CiNii Research CiNii 国立情報学研究所 学術情報
ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす …

Let x (G (n, p)) denote the chromatic number of the random graph G (n, p). We prove that for
every constant e> 0 there exists a constant de such that for np (n)> d,, p (n)–0, the probability …

The chromatic number of random graphs CNRS Inist Pascal-Francis CNRS Pascal and
Francis Bibliographic Databases Simple search Advanced search Search by classification …