Asymptotic values of the Hall-ratio for graph powers

Discrete Mathematics

Volumn 306, Issue 19-20, 2006, Pages 2593-2601

  Simonyi, Gábor ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Fractional chromatic number; Graph power; Hall ratio; Shannon capacity

Indexed keywords

ASYMPTOTIC STABILITY; NUMERICAL ANALYSIS; NUMERICAL METHODS;

FRACTIONAL CHROMATIC NUMBER; GRAPH POWER; HALL-RATIO; SHANNON CAPACITY;

GRAPH THEORY;

EID: 33748746050     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.042     Document Type: Article

References (26)

1. Alon N. The Shannon capacity of a union. Combinatorica 18 (1998) 301-310
2. N. Alon, Graph powers, in: Contemporary Combinatorics, Bolyai Society Mathematical Studies, vol. 10, János Bolyai Mathematical Society, Budapest, 2002, pp. 11-28.
3. Alon N., Dinur I., Friedgut E., and Sudakov B. Graph products, Fourier analysis and spectral techniques. Geom. Funct. Anal. 14 (2004) 913-940
4. Alon N., and Orlitsky A. Repeated communication and Ramsey graphs. IEEE Trans. Inform. Theory 41 (1995) 1276-1289
5. Berge C. Hypergraphs (1989), North-Holland, Amsterdam
6. Berge C., and Ramírez-Alfonsín J.L. Origins and genesis. In: Ramírez-Alfonsín J.L., and Reed B.A. (Eds). Perfect Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization (2001), Wiley, Chichester 1-12 (Chapter 1)
7. 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, OH, 1972 (dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Springer, Berlin, 1974, pp. 21-33.
8. Brown J.I., Nowakowski R.J., and Rall D. The ultimate categorical independence ratio of a graph. SIAM J. Discrete Math. 9 (1996) 290-300
9. M. Cropper, A. Gyárfás, J. Lehel, Hall-ratio of the Mycielski graphs, Manuscript, submitted for publication.
10. Csiszár I. The method of types. IEEE Trans. Inform. Theory (commemorative issue) 44 6 (1998) 2505-2523
11. Csiszár I., and Körner J. Information Theory. Coding Theorems for Discrete Memoryless Systems (1982), Academic Press, New York
12. Farber M. An analogue of the Shannon capacity of a graph. SIAM J. Algebraic Discrete Methods 7 (1986) 67-72
13. Geller D., and Stahl S. The chromatic number and other functions of the lexicographic product. J. Combin. Theory Ser. B 19 (1975) 87-95
14. Hahn G., Hell P., and Poljak S. On the ultimate independence ratio of a graph. European J. Combin. 16 (1995) 253-261
15. Hell P., and Roberts F.S. Analogues of the Shannon capacity of a graph. Ann. Discrete Math. 12 (1982) 155-168
16. Hell P., Yu X., and Zhou H. Independence ratios of graph powers. Discrete Math. 127 (1994) 213-220
17. Imrich W., and Klavžar S. Product Graphs. Structure and Recognition, Wiley-Interscience Series in Discrete Mathematics and Optimization (2000), Wiley, Chichester
18. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13 (1975) 383-390
19. Lovász L. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25 (1979) 1-7
20. Marton K. On the Shannon capacity of probabilistic graphs. J. Combin. Theory Ser. B 57 (1993) 183-195
21. McEliece R.J., and Posner E.C. Hide and seek, data storage, and entropy. Ann. Math. Statist. 42 (1971) 1706-1716
22. Pólya G., and Szego{combining double acute accent} G. Problems and Theorems in Analysis (1972), Springer, New York
23. Scheinerman E.R., and Ullman D.H. Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization (1997), Wiley, Chichester
24. Shannon C.E. The zero-capacity of a noisy channel. IRE Trans. Inform. Theory 2 (1956) 8-19
25. Witsenhausen H.S. The zero-error side-information problem and chromatic numbers. IEEE Trans. Inform. Theory 22 (1976) 592-593
26. Zhu X. On the bounds for the ultimate independence ratio of a graph. Discrete Math. 156 (1996) 229-236