Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Packing tools
A recently located independence bound
Abiad, Kumar, and Pragada, Localization of the Caro--Wei bound and its applications to bipartiteness, arXiv:2609.00210v1 (31 August 2026), Theorems 2.2 and 3.1, prove
where is the largest clique order through . The inequality portion of their quadratic minimization/private-neighbor proof was read and checked by the author. The equality classification is not needed here. Jensen's inequality gives
This input is outside the originally supplied source bundle; its provenance is therefore explicit rather than silently treated as an old known theorem.
In averaged form, Jensen and give
The primary paper's Theorem 2.2 inequality proof and Theorem 3.1 statement were rechecked.