arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0611262math.CO
收藏

当ch(K(m,n))=m-1?

When is ch(K(m,n))=m-1?

Nurit Gazit

摘要:

设n_m是使ch(K_{m,n})= m-1的最小整数n,其中ch(G)表示图G的选择(列表色)数.证明了存在一个无穷序列S,使得若m在S中,则n_m <= 0.4643((m-2)^(m-2)).如果m ->无穷大,则n_m渐近地至多为0.474((m-2)^(m-2))。

英文摘要:

Let n_m be the smallest integer n such that ch(K_{m,n}) = m-1, where ch(G) denotes the choice (list chromatic) number of the graph G. We prove that there is an infinite sequence of integers S, such that if m is in S, then n_m <= 0.4643 ((m-2)^(m-2)). If m -> infinity, then n_m is asymptotically at most 0.474 ((m-2)^(m-2)).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑