arXiv:2402.10025 [math.CO]AbstractReferencesReviewsResources
An improved lower bound on the Shannon capacities of complements of odd cycles
Published 2024-02-15, updated 2024-05-30Version 2
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 + \Omega(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.
Comments: 7 pages, 1 figure
Related articles: Most relevant | Search more
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
arXiv:1002.0095 [math.CO] (Published 2010-01-30)
A conjecture of Erdős on graph Ramsey numbers
arXiv:math/0407292 [math.CO] (Published 2004-07-16)
Lower bound for the size of maximal nontraceable graphs