Combinatorica
Lopsided Lova´sz Local Lemma and Latin transversals
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
A Note on Vertex List Colouring
Combinatorics, Probability and Computing
On Dependency Graphs and the Lattice Gas
Combinatorics, Probability and Computing
A constructive proof of the general lovász local lemma
Journal of the ACM (JACM)
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Random Structures & Algorithms
Improved bounds on coloring of graphs
European Journal of Combinatorics
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Random Structures & Algorithms
Hi-index | 0.00 |
An old result by Shearer relates the Lovász local lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard-core lattice gas on graphs. We use this connection and a recent result on the analyticity of the logarithm of the partition function of the abstract polymer gas to get an improved version of the Lovász local lemma. As an application we obtain tighter bounds on conditions for the existence of Latin transversal matrices.