奇圈补图的香农容量的改进下界
An improved lower bound on the Shannon capacities of complements of odd cycles
AI总结:
本文改进 Bohman 和 Holzman 的结果,给出奇圈补图香农容量的更强下界,并揭示其与图 Ramsey 数研究的联系。
摘要:
改进 Bohman 和 Holzman 在 2003 年的结果,我们证明对于 $n \geq 1$,$2n+1$-圈补图的香农容量至少为 $(2^{r_n} + 1)^{1/r_n} = 2 + Ω(2^{-r_n}/r_n)$,其中 $r_n = \exp(O((\log n)^2))$ 是将 $2(n-1)$ 划分为 2 的幂的分拆数。我们还讨论了该结果与 Day 和 Johnson 在图 Ramsey 数背景下工作之间的联系。
英文摘要:
Improving a 2003 result of Bohman and Holzman, we show that for $n \geq 1$, the Shannon capacity of the complement of the $2n+1$-cycle is at least $(2^{r_n} + 1)^{1/r_n} = 2 + Ω(2^{-r_n}/r_n)$, where $r_n = \exp(O((\log n)^2))$ is the number of partitions of $2(n-1)$ into powers of $2$. We also discuss a connection between this result and work by Day and Johnson in the context of graph Ramsey numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。