Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Dubickas, Artūras
2008.
An estimate for the probability of dependent events.
Statistics & Probability Letters,
Vol. 78,
Issue. 17,
p.
2839.
Balister, Paul
Bollobás, Béla
and
Gerke, Stefanie
2008.
Sequences with Changing Dependencies.
SIAM Journal on Discrete Mathematics,
Vol. 22,
Issue. 3,
p.
1149.
Andrén, Daniel
and
Markström, Klas
2009.
The bivariate Ising polynomial of a graph.
Discrete Applied Mathematics,
Vol. 157,
Issue. 11,
p.
2515.
Rosenfeld, Vladimir R.
2010.
The independence polynomial of rooted products of graphs.
Discrete Applied Mathematics,
Vol. 158,
Issue. 5,
p.
551.
Kolipaka, Kashyap Babu Rao
and
Szegedy, Mario
2011.
Moser and tardos meet Lovász.
p.
235.
BISSACOT, RODRIGO
FERNÁNDEZ, ROBERTO
PROCACCI, ALDO
and
SCOPPOLA, BENEDETTO
2011.
An Improvement of the Lovász Local Lemma via Cluster Expansion.
Combinatorics, Probability and Computing,
Vol. 20,
Issue. 5,
p.
709.
Lass, Bodo
2012.
Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs.
Journal of Combinatorial Theory, Series B,
Vol. 102,
Issue. 2,
p.
411.
Pegden, Wesley
2012.
The lefthanded local lemma characterizes chordal dependency graphs.
Random Structures & Algorithms,
Vol. 41,
Issue. 4,
p.
546.
Kolipaka, Kashyap
Szegedy, Mario
and
Xu, Yixin
2012.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 7408,
Issue. ,
p.
603.
Rosenfeld, Vladimir R.
and
Klein, Douglas J.
2013.
Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts.
Journal of Mathematical Chemistry,
Vol. 51,
Issue. 1,
p.
21.
Szegedy, Mario
2013.
Computer Science – Theory and Applications.
Vol. 7913,
Issue. ,
p.
1.
CSIKVÁRI, PÉTER
2013.
Note on the Smallest Root of the Independence Polynomial.
Combinatorics, Probability and Computing,
Vol. 22,
Issue. 1,
p.
1.
Alves, Rogério Gomes
and
Procacci, Aldo
2014.
Witness Trees in the Moser–Tardos Algorithmic Lovász Local Lemma and Penrose Trees in the Hard-Core Lattice Gas.
Journal of Statistical Physics,
Vol. 156,
Issue. 5,
p.
877.
Liao, Yunhua
and
Xie, Xiaoliang
2015.
Independence polynomial and matching polynomial of the Koch network.
International Journal of Modern Physics B,
Vol. 29,
Issue. 32,
p.
1550234.
HOLROYD, ALEXANDER E.
and
LIGGETT, THOMAS M.
2016.
FINITELY DEPENDENT COLORING.
Forum of Mathematics, Pi,
Vol. 4,
Issue. ,
He, Kun
Li, Liang
Liu, Xingwu
Wang, Yuyi
and
Xia, Mingji
2017.
Variable-Version Lovász Local Lemma: Beyond Shearer's Bound.
p.
451.
Day, A. Nicholas
Falgas‐Ravry, Victor
and
Hancock, Robert
2020.
Long paths and connectivity in 1‐independent random graphs.
Random Structures & Algorithms,
Vol. 57,
Issue. 4,
p.
1007.
Blažej, Václav
Dvořák, Pavel
and
Opler, Michal
2021.
Graph-Theoretic Concepts in Computer Science.
Vol. 12911,
Issue. ,
p.
283.
Liggett, Thomas M.
and
Tang, Wenpin
2023.
One-dependent colorings of the star graph.
The Annals of Applied Probability,
Vol. 33,
Issue. 6A,
Jenssen, Matthew
2024.
Surveys in Combinatorics 2024.
p.
55.