On a problem of Spencer
From MaRDI portal
Publication:1072210
DOI10.1007/BF02579368zbMath0587.60012OpenAlexW2047290604WikidataQ56565510 ScholiaQ56565510MaRDI QIDQ1072210
Publication date: 1985
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579368
Related Items (48)
On Conflict-Free Multi-coloring ⋮ Domination by product measures ⋮ Sets of permutations that generate the symmetric group pairwise. ⋮ Commutativity in the Algorithmic Lovász Local Lemma ⋮ Algorithmic Pirogov-Sinai theory ⋮ Absence of zeros implies strong spatial mixing ⋮ Conflict‐free chromatic number versus conflict‐free chromatic index ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials ⋮ Improved bounds on coloring of graphs ⋮ One-dependent colorings of the star graph ⋮ Probability bounds for \(n\) random events under \((n-1)\)-wise independence ⋮ Unnamed Item ⋮ Packing list‐colorings ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Unnamed Item ⋮ FINITELY DEPENDENT COLORING ⋮ New bounds for the Moser‐Tardos distribution ⋮ Shearer's measure and stochastic domination of product measures ⋮ The Ising partition function: zeros and deterministic approximation ⋮ Cayley trees do not determine the maximal zero-free locus of the independence polynomial ⋮ An estimate for the probability of dependent events ⋮ A Kolmogorov complexity proof of the Lovász local lemma for satisfiability ⋮ Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ Entropy compression versus Lovász local lemma ⋮ Covering systems with restricted divisibility ⋮ On a conjecture of Sokal concerning roots of the independence polynomial ⋮ Fisher zeros and correlation decay in the Ising model ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ SIR epidemics on a scale-free spatial nested modular network ⋮ Directed Lovász local lemma and Shearer's lemma ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ On codes with the identifiable parent property ⋮ Fisher Zeros and Correlation Decay in the Ising Model ⋮ The Lovász Local Lemma and Satisfiability ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability ⋮ Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma ⋮ \(k\)-independent percolation on trees ⋮ An Improvement of the Lovász Local Lemma via Cluster Expansion ⋮ The hat guessing number of graphs ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma ⋮ Implementations and the independent set polynomial below the Shearer threshold ⋮ Partially Independent Random Variables ⋮ The lefthanded local lemma characterizes chordal dependency graphs
Cites Work
This page was built for publication: On a problem of Spencer
