On the stochastic independence properties of hard-core distributions

DOI10.1007/BF01215919zbMath0902.05055MaRDI QIDQ1272181

P. Mark Kayll, Jeffry Kahn

Publication date: 23 November 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

graphhypergraphstochastic independencemarginalsmatching polytopehard-core distribution

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Hypergraphs (05C65) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (6)

Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Random sampling for the monomer–dimer model on a lattice ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of the chromatic index for multigraphs
• Percolation and the hard-core lattice gas model
• Fractional v. integral covers in hypergraphs of bounded edge size
• Matchings and covers in hypergraphs
• Theory of monomer-dimer systems
• On the theory of the matching polynomial
• Maximum matching and a polyhedron with 0,1-vertices
• A normal law for matchings

This page was built for publication: On the stochastic independence properties of hard-core distributions