Proof of `Numbering finite graphs and the size of their encoding` (2nd statement)
groundedproofs/Lax323828Proofs/GraphEncoding.lean · lax-323828
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The unary vertex count and delimiter occupy n+1 bits, and the n rows of the adjacency matrix occupy n bits each.