On homomorphisms from the hamming cube to Z

Israel Journal of Mathematics

Volumn 138, Issue , 2003, Pages 189-213

  Galvin, David ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442291621     PISSN: 00212172     EISSN: 15658511     Source Type: Journal    
DOI: 10.1007/BF02783426     Document Type: Article

References (17)

1. C. A. Athanasiadis, Algebraic combinatorics of graph spectra, subspace arrangements, and Tutte polynomials, Thesis, Massachusetts Institute of Technology, 1996.
2. I. Benjamini, O. Häggström and E. Mossel, On random graph homomorphisms into Z, Journal of Combinatorial Theory. Series B 78 (2000), 86-114.
3. B. Bollobás, Combinatorics, Cambridge University Press, Cambridge, 1986.
4. B. Bollobás, Modern Graph Theory, Springer, New York, 1998.
5. R. Diestel, Graph Theory, Springer, New York, 1997.
6. Z. Füredi, Matchings and covers in hypergraphs, Graphs and Combinatorics 4 (1988), 115-206.
7. J. Kahn, Range of the cube-indexed random walk, Israel Journal of Mathematics 124 (2001), 189-201.
8. J. Kahn and A. Lawrenz, Generalized rank functions and an entropy argument, Journal of Combinatorial Theory. Series A 87 (1999), 398-403.
9. D. Knuth, The Art of Computer Programming, Vol. I, Addison Wesley, London, 1969.
10. J. Körner and V. Wei, Odd and even Hamming spheres also have minimum boundary, Discrete Mathematics 51 (1984), 147-165.
11. A. D. Korshunov and A. A. Sapozhenko, The number of binary codes with distance 2, Problemy na Kibernetika 40 (1983), 111-130 (Russian).
12. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Mathematics 13 (1975), 383-390.
13. D. Randall, personal communication.
14. A. A. Sapozhenko, On the number of connected subsets with given cardinality of the boundary in bipartite graphs, Metody Diskretnogo Analiza 45 (1987), 42-70 (Russian).
15. A. A. Sapozhenko, The number of antichains in ranked partially ordered sets, Diskretnaya Matematika 1 (1989), 74-93 (Russian; translation in Discrete Mathematics and Applications 1, no. 1 (1991), 35-58).
16. A. A. Sapozhenko, The number of antichains in ranked partially ordered sets, Diskretnaya Matematika 1 (1989), 74-93 (Russian; translation in Discrete Mathematics and Applications 1, no. 1 (1991), 35-58).
17. S. K. Stein, Two combinatorial covering theorems, Journal of Combinatorial Theory. Series A 16 (1974), 391-397.