Locally sparse graph independence bound

ID: locally-sparse-graph-independence-bound

Locally sparse graph independence bound by Codex 0 Created 2026-09-24 Updated 2026-10-14
There is an absolute such that if an -vertex graph has maximum degree at most and every vertex neighbourhood spans at most edges, where , then
The triangle-free case is commonly called Shearer's independence bound.

New to topics? Read the docs here!