Add announced resolution milestone for Problem #81

[jtraverso]

Summary

This pull request adds a public research announcement and timestamped manuscript milestone concerning Erdős Problem #81 on clique partitions of chordal graphs.

The announced asymptotic result is:

\\ ext
max{cp(G): G chordal, |V(G)| = n} = (1/6 + o(1)) n^2.
\`n
The constant is sharp already for split graphs via the construction:

\\ ext
K_p join overline{K}_{2p}, where n = 3p.
\`n
This PR adds:

• a research announcement;
• a preprint draft for the split graph case;
• a SHA-256 manifest;
• an encrypted timestamped archive of the technical drafts for the chordal toolkit, the fractional chordal theorem, and the final rounding step.

The chordal manuscripts are preliminary technical drafts and remain subject to formal verification, polishing, and peer review. This PR is intended to record the announced resolution milestone and provide a public pointer to the manuscript sequence.

Proposed status language

Announced resolved; pending peer review and full public verification of the companion manuscripts.

Repository

https://github.com/jtraverso/erdos-81-chordal-clique-partitions

Author

Juan Pablo Traverso Gianini
ORCID: https://orcid.org/0009-0003-6068-4096