Erdős problem 80
Erdős problem 80
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Erdős problem 80
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Native pull-request state, mechanical checks, semantic findings, and artifact availability are separate source facts. None is a Vela Verification, Decision, or change to Math Standing.
Formal Conjectures PR #4830
hypothesis satisfiability
At exact PR 4830 head e2e2a606/blob 9dd6a993, Admissible requires c*n^2 edges in a simple n-vertex graph while the theorem quantifies over every c>0.
Witness: At c=2 and n=100 the hypothesis needs 20000 edges, but a simple graph has at most 4950; the admissible set is empty and sInf is 0.
Limit: The witness establishes the vacuity defect at the stated parameter, not a replacement theorem.
Read-only projection
Approval and merge remain upstream PR state. A passing build does not establish semantic fidelity. An unavailable artifact identity is not a proof failure.
Adapter conformance 9 / 9: exact source revision, bounded complete reads, typed roots, custody, implementation identity, reconstructibility, unsupported-state refusal, rights, and lifecycle semantics.
Find a Problem, Result, source, or page