Uniquely Colourable Graphs with Large Girth
Uniquely Colourable Graphs with Large Girth
复制标题
独特的大周长彩色图表
DOI：
10.4153/cjm-1976-133-5
复制
发表时间：
1976
期刊：
影响因子：
--
通讯作者：
N. Sauer
中科院分区：
文献类型：
--
作者：
B. Bollobás;N. Sauer
Tutte [1]以笔名写作，是第一个证明具有大色数的图不需要包含三角形的人。这个结果被Zykov [5]和Mycielski [4]重新发现。Erdös [2]证明了一个强得多的结果：对任意k ∈ 2和g，存在一个围长至少为g的k-色图。
Tutte [1], writing under a pseudonym, was the first to prove that a graph with a large chromatic number need not contain a triangle. The result was rediscovered by Zykov [5] and Mycielski [4]. Erdös [2] proved the much stronger result that for every k ≧ 2 and g there exist a k-chromatic graph whose girth is at least g.