A limit theorem for the Shannon capacities of odd cycles I

被引：13

作者：

Bohman, T ^{[1
]}

机构：

[1] MIT, Dept Math, Cambridge, MA 02139 USA

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2003年 / 131卷 / 11期

关键词：

Shannon capacity; odd cycles;

D O I：

10.1090/S0002-9939-03-06495-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper contains a construction for independent sets in the powers of odd cycles. It follows from this construction that the limit as n goes to infinity of n + 1/2 - Theta (C2n+1) is zero, where Theta(G) is the Shannon capacity of the graph G.

引用

页码：3559 / 3569

页数：11

共 12 条

[1] The Shannon capacity of a union [J].

Alon, N .

COMBINATORICA, 1998, 18 (03) :301-310

[2]

Baumert L., 1971, COMPUTERS ALGEBRA NU, p[97, American]

[3]

BERGE C, 1973, BALANCED HYPERGRAPHS

[4]

BOHMAN T, P 2000 IEEE INT S IN, P179

[5] SOME PROBLEMS OF LOVASZ CONCERNING THE SHANNON CAPACITY OF A GRAPH [J].

HAEMERS, W .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (02) :231-232

[6]

Haemers WH., 1978, C MATH SOC J BOLYAI, V25, P267

[7]

Hales R. S., 1973, Journal of Combinatorial Theory, Series B, V15, P146, DOI 10.1016/0095-8956(73)90014-2

[8] Zero-error information theory [J].

Korner, J ;

Orlitsky, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2207-2229

[9] ON THE SHANNON CAPACITY OF A GRAPH [J].

LOVASZ, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) :1-7

[10]

McEliece R. J., 1978, J COMBIN INFORM SYST, V3, P134

← 1 2 →