A survey of the hard-core model and the local occupancy method, showing how local analysis of independent sets yields global bounds in graph theory.
Alon, Independence numbers of locally sparse graphs and a Ramsey type problem, Random Structures Algorithms 9 (1996), 271–278
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The hard-core model in graph theory
A survey of the hard-core model and the local occupancy method, showing how local analysis of independent sets yields global bounds in graph theory.