Local chromatic number and Sperner capacity

Journal of Combinatorial Theory. Series B

Volumn 95, Issue 1, 2005, Pages 101-117

  Körner, János ^a   Pilotto, Concetta ^a   Simonyi, Gábor ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Fractional chromatic number; Local chromatic number; Shannon capacity; Sperner capacity

Indexed keywords

EID: 23244459025     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.03.006     Document Type: Article

References (25)

1. N. Alon On the capacity of digraphs European J. Combin. 19 1998 1-5
2. N. Alon The Shannon capacity of a union Combinatorica 18 1998 301-310
3. N. Alon, Graph powers, in: B. Bollobás (Ed.), Contemporary Combinatorics, Bolyai Society Mathematical Studies, Springer, 2002, pp. 11-28.
4. C. Berge, M. Simonovits, The coloring numbers of the direct product of two hypergraphs, in: Hypergraph Seminar (Proceedings of the First Working Seminar, Ohio State University, Columbus, Ohio, 1972; dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Springer, Berlin, 1974, pp. 21-33.
5. E. Bidamon H. Meyniel On the Shannon capacity of a directed graph European J. Combin. 6 1985 289-290
6. A. Blokhuis On the Sperner capacity of the cyclic triangle J. Algebraic Combin. 2 1993 123-124
7. T. Bohman R. Holzman A nontrivial lower bound on the Shannon capacities of the complements of odd cycles IEEE Trans. Inform. Theory 49 2003 721-722
8. R. Calderbank P. Frankl R.L. Graham W. Li L. Shepp The Sperner capacity of the cyclic triangle for linear and non-linear codes J. Algebraic Combin. 2 1993 31-48
9. I. Csiszár, J. Körner, Information theory: Coding theorems for discrete memoryless systems, Academic Press, New York, 1982 and Akadémiai Kiadó, Budapest, 1981.
10. P. Erdos Z. Füredi A. Hajnal P. Komjáth V. Rödl Á. Seress Coloring graphs with locally few colors Discrete Math. 59 1986 21-34
11. E. Fachini J. Körner Colour number, capacity and perfectness of directed graphs, Graphs Combin. 16 2000 389-398
12. Z. Füredi, Local colourings of graphs (Gráfok lokális színezései), manuscript in Hungarian, September 2002.
13. A. Galluccio L. Gargano J. Körner G. Simonyi Different capacities of a digraph Graphs Combin. 10 1994 105-121
14. L. Gargano J. Körner U. Vaccaro Sperner theorems on directed graphs and qualitative independence J. Combin. Theory Ser. A 61 1992 173-192
15. L. Gargano J. Körner U. Vaccaro Capacities: From information theory to extremal set theory J. Combin. Theory Ser. A 68 1994 296-316
16. C. Godsil G. Royle Algebraic Graph Theory, Graduate Texts in Mathematics vol. 207 2001 Springer New York
17. T.R. Jensen B. Toft Graph Colouring Problems, Wiley-Interscience Series in Discrete Mathematics and Optimization 1995 Wiley New York
18. J. Körner, A. Orlitsky, Zero-error information theory, IEEE Trans. Inform. Theory 44(6) (October 1998, commemorative issue) 2207-2229.
19. J. Körner G. Simonyi A Sperner-type theorem and qualitative independence J. Combin. Theory Ser. A 59 1992 90-103
20. L. Lovász On the Shannon capacity of a graph IEEE Trans. Inform. Theory 25 1979 1-7
21. R.J. McEliece E.C. Posner Hide and seek, data storage, and entropy Ann. Math. Statist. 42 1971 1706-1716
22. A. Sali G. Simonyi Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities European J. Combin. 20 1999 93-99
23. E.R. Scheinerman D.H. Ullman Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization 1997 Wiley Chichester
24. C.E. Shannon The zero-capacity of a noisy channel IRE Trans. Inform. Theory 2 1956 8-19
25. G. Simonyi, G. Tardos, Local chromatic number, Ky Fan's theorem, and circular colorings, manuscript, arXiv:math.CO/0407075.