Name
Abstract | ||
|---|---|---|
This article contains a construction for independent sets in the powers of the complements of odd cycles. In particular, we show that α(C~2n+3(2n))≥2(2n)+1. It follows that for n≥0 we have Θ(C~2n+3)>2, where Θ(G) denotes the Shannon (1956) capacity of graph G. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/TIT.2002.808128 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
channel capacity,graph theory,Shannon capacities,memoryless communication channel,nontrivial lower bound,odd cycle complements | Information theory,Graph theory,Discrete mathematics,Graph,Combinatorics,Upper and lower bounds,Channel capacity,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 3 | 0018-9448 |
Citations | PageRank | References |
5 | 0.63 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Holzman, R. | 2 | 5 | 0.63 |