Add public manuscript package for announced Problem #81 resolution

[jtraverso]

Summary

This pull request adds a public manuscript package for the announced resolution 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
This PR follows the previously proposed structure under #81/announced_resolution/, but now includes the companion manuscripts openly.

Added public materials

• Research announcement (md, ex, pdf).
• Paper A: split graph preprint draft (md, ex, pdf).
• Paper B: chordal toolkit technical draft (md, ex, pdf).
• Paper C: fractional chordal theorem technical draft (md, ex, pdf).
• Paper D: chordal clique partition theorem technical draft (md, ex, pdf).
• SHA-256 manifest, citation metadata, license, and release notes.
• The original encrypted archive is retained only as a historical timestamp record.

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