On Dependency Graphs and the Lattice Gas

DOI10.1017/S0963548305007182zbMath1138.05323WikidataQ56893169 ScholiaQ56893169MaRDI QIDQ3373668

Alexander D. Scott, Alan D. Sokal

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (14)

Bears with hats and independence polynomials ⋮ Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs ⋮ One-dependent colorings of the star graph ⋮ FINITELY DEPENDENT COLORING ⋮ Note on the Smallest Root of the Independence Polynomial ⋮ The Ramsey Number for 3-Uniform Tight Hypergraph Cycles ⋮ An estimate for the probability of dependent events ⋮ The bivariate Ising polynomial of a graph ⋮ The independence polynomial of rooted products of graphs ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ Long paths and connectivity in 1‐independent random graphs ⋮ An Improvement of the Lovász Local Lemma via Cluster Expansion ⋮ The lefthanded local lemma characterizes chordal dependency graphs

This page was built for publication: On Dependency Graphs and the Lattice Gas