On the stochastic independence properties of hard-core distributions

Combinatorica

Volumn 17, Issue 3, 1997, Pages 369-391

  Kahn, Jeff ^a   Kayll, P Mark ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF MONTANA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031439717     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01215919     Document Type: Article

References (27)

1. N. ALON and J. SPENCER: The Probabilistic Method, Wiley, New York, 1992.
2. J. VAN DEN BERG and J. E. STEIF: Percolation and the hard-core lattice gas model, Stochastic Process. Appl., 49 (1994), 179-197.
3. C. BERGE: Hypergraphs: Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
4. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, London, 1978.
5. J. EDMONDS: Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards (B), 69 (1965), 125-130.
6. Z. FÜREDI: Matchings and covers in hypergraphs, Graphs Combin., 4 (1988), 115-206.
7. C. D. GODSIL and I. GUTMAN: On the theory of the matching polynomial, J. Graph Theory 5 (1981), 137-144.
8. C. D. GODSIL: Algebraic Combinatorics, Chapman and Hall, New York, 1993.
9. O. J. HEILMANN and E. H. LIEB: Monomers and dimers, Phys. Rev. Letters, 24 (1970), 1412-1414.
10. O. J. HEILMANN and E. H. LIEB: Theory of monomer-dimer systems, Commun. Math. Phys., 25 (1972), 190-232.
11. J. KAHN: Asymptotics of the chromatic index for multigraphs, J. Combin. Theory Ser. B, 68 (1996), 233-254.
12. J. KAHN: Asymptotics of the list-chromatic index for multigraphs, submitted.
13. J. KAHN: A normal law for matchings, submitted.
14. J. KAHN and P. M. KAYLL: Fractional v. integral covers in hypergraphs of bounded edge size, J. Combin. Theory Ser. A, 78 (1997), 199-235.
15. J. KAHN and J.-H. KIM: Random matchings in regular graphs, Combinatorica, to appear.
16. P. M. KAYLL: Asymptotically Good Covers in Hypergraphs, Dissertation, Rutgers University, New Brunswick, NJ, 1994.
17. P. M. KAYLL: Asymptotically good covers in hypergraphs, Diss. Summ. Math., 1 (1996), 9-16.
18. P. M. KAYLL: "Normal" distributions on matchings in a multigraph: overview with applications, Congr. Numer., 107 (1995), 179-191.
19. H. KUNZ: Location of the zeros of the partition function for some classical lattice systems, Phys. Lett., 32A (1970), 311-312.
20. C. W LEE: Some recent results on convex polytopes, Contemporary Mathematics, 114 (1990), 3-19.
21. C. W. LEE: Convex polytopes, the moment map, and canonical convex combinations, manuscript, 1994.
22. G. M. LOUTH: Stochastic Networks: Complexity, Dependence and Routing, Dissertation, Cambridge University, 1990.
23. L. LOVÁSZ and M. D. PLUMMER: Matching Theory, North-Holland, New York, 1986.
24. J. R. MUNKRES: Elements of Algebraic Topology, Benjamin/Cummings, Menlo Park, 1984.
25. Y. RABINOVICH, A. SINCLAIR and A. WIGDERSON: Quadratic Dynamical Systems (Preliminary Version), in: Proc. 33rd IEEE Symposium on Foundation of Computer Science, pp. 304-313, 1992.
26. A. SCHRIJVER: Theory of Linear and Integer Programming, Wiley, New York, 1986.
27. J. SPENCER: Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1993.