科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let T2(n) denote Turan's graphthe complete 2-partite graph on n vertices with partition sizes as equal as possible. We show that for all n4, the graph T2(n) has more proper vertex colorings in at most 4 colors than any other graph with the same number of vertices and edges.
- 出版日期2014-3
