finding record / erdos
recordedvf_28fbed2addd2e6d2
vf_28fbed2addd2e6d2
Canonical assertion
The drafted Formal Conjectures statement for Erdős problem 24 (statements/24/24.lean) faithfully represents the boxed problem; machine verdict on the linked hosted proof: unconditional (plby).
Notation is rendered from the stored source. The pinned checkout remains the exact record.
- expert_assertion
- theoretical
- 0 spans
- recorded
Scope and conditions
theoretical
Count vocabulary: draft uses Mathlib's SimpleGraph.copyCount G (cycleGraph 5) (number of subgraphs of G isomorphic to C5); both hosted proofs define numC5 G = #{labelled C5 maps Fin 5 -> V} / 10 (labelled embeddings divided by |D5| = 10). The two counts are equal on every graph (each C5-subgraph carries exactly 10 labellings), so this is neither a strengthening nor a weakening.; Form: draft wraps
Provenance summary
- campaign batch-3
- expert_assertion
- Jul 1, 2026, 9:46 PM
- not recorded
- 0
Exact record identityFinding ID, frontier identity, and pinned Git source
- vf_28fbed2addd2e6d2
- vfr_0a25edabc16db143
- ce8ba7d934c848408e0d91caca39e938698e3fc7
- 03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Source identity
- Commit
- ce8ba7d934c848408e0d91caca39e938698e3fc7
- Tree
- 03f7371b496485f761f91961027fd48198dc7e93
- Committed
- 2026-07-20T19:20:20-04:00
- Repository
- Open source
Content roots
- Event log
- sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
- Snapshot
- sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
- Proposals
- sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
- Actor registry
- sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
- Artifacts
- sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da