An Entropy Approach to the Hard-Core Model on Bipartite Graphs

Combinatorics Probability and Computing

Volumn 10, Issue 3, 2001, Pages 219-237

  Kahn, Jeff ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035626591     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301004631     Document Type: Article

References (15)

1. Alon, N. (1991) Independent sets in regular graphs and sum-free subsets of finite groups. Israel J. Math. 73 247-256.
2. van den Berg, J. Private communication.
3. van den Berg, J. and Steif, J. E. (1994) Percolation and the hardcore lattice gas model. Stoch. Proc. Appl. 49 179-197.
4. Bollobás, B. (1986) Combinatorics, Cambridge University Press, Cambridge.
5. Bollobás, B. (1998) Modern Graph Theory, Springer, New York.
6. Calkin, N. J. and Wilf, H. S. (1998) The number of independent sets in a grid graph. SIAM J. Discrete Math. 11 54-60.
7. Chung, F. R. K., Frankl, P., Graham, R. and Shearer, J. B. (1986) Some intersection theorems for ordered sets and graphs. J. Combin. Theory Ser. A 48 23-37.
8. Dobrushin, R. L. (1968) The problem of uniqueness of a Gibbs random field and the problem of phase transition. Functional Anal. Appl. 2 302-312.
9. Frankl, P. (1987) The shifting technique in extremal set theory. In Surveys in Combinatorics (C. Whitehead, ed.), Cambridge University Press, Cambridge, pp. 81-110.
10. Georgii, H.-O. (1988) Gibbs Measures and Phase Transitions, de Gruyter, Berlin.
11. 2 with parity-dependent activities. Ark. Mat. 35 171-184.
12. Harper, L. H. (1966) Optimal numberings and isoperimetric problems on graphs. J. Combin. Theory 1 385-394.
13. Kahn, J. and Lawrenz, A. (1999) Generalized rank functions and an entropy argument. J. Combin. Theory Ser. A 87 398-403.
14. McEliece, R. J. (1977) The Theory of Information and Coding, Addison-Wesley, London.
15. Radhakrishnan, J. (1997) An entropy proof of Bregman's theorem. J. Combin. Theory Ser. A 77 161-164.