Three layers of understanding
01 · Understand the problem
A graph is a network of points and links. Add enough links and particular patterns become unavoidable. Extremal graph theory asks where that transition occurs.
02 · Understand the contribution
The release reports results on compactness and degeneracy conjectures, associated with Erdős problems 146 and 180.
03 · Academic context
The forbidden graph, asymptotic variable and density notion must be fixed before comparing bounds. Degeneracy constrains how sparse every subgraph can remain under successive deletion. Compactness questions concern whether restrictions from a family can be captured by finitely many members in the relevant extremal sense. These are distinct claims and should be audited separately within the released manuscript.
What this might change
Potentially improves the structural tools used to connect local constraints with global network density.
What is NOT established
This dossier groups the related announcement rather than counting it as several independent verified wins. We have not reproduced the proofs.