evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_888ec436e8a369e3"}
- id
- vea_558e3e03e9523283
- frontier
- Erdős problems frontier
- source
- vs_b052ace4f887caf5
- finding
- vf_bf2be6a3d0b20a34
finding binding
boundtheoretical
Erdős Problem #1077 has been DISPROVED (a counterexample is known). Statement: We call a graph $D$-balanced (or $D$-almost-regular) if the maximum degree is at most $D$ times the minimum degree. Let $ε, α > 0$ and $D$ and $n$ be sufficiently large. If $G$ is a graph on $n$ vertices with at least $n^{1+α}$ edges, then must $G$ contain a $D$-balanced subgraph on $m > n^{1-α}$ vertices with at least $εm^{1+α}$ edges? Topics: graph theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_888ec436e8a369e3
vs_b052ace4f887caf5
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_888ec436e8a369e3"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_b528f3f443bbb92d
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_0e30ee808fa867d8finding.assertedCandidate claim vc_888ec436e8a369e3 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_fc6f7efa5eddd345finding.addCandidate claim vc_888ec436e8a369e3 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.