The Chromatic Number of Random Regular Graphs
Lecture Notes in Computer Science（2004）
摘要
Given any integer d greater than or equal to 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1, or k + 2.
更多查看译文
关键词
neural network,statistical mechanics,regular graph
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要