Erdős Problem #584
Prior state unknown→disproved
the literal wording is refuted; the intended variant remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Extremal Graph Theory
Erdős Problem #584
Must every graph with $n$ vertices and $\delta n^2$ edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when $\delta$ may shrink with $n$.
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
Must every graph with $n$ vertices and $\delta n^2$ edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when $\delta$ may shrink with $n$.
the literal wording is refuted; the intended variant remains open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.