Erdős problem 584
Must every graph with vertices and edges contain large subgraphs in which every two edges lie on specified short cycles? A dense high-girth construction refutes the statement when may shrink with .
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:927e660372e402b0fad6d7e25ebf6fbbfef6230c22f4942c2f22caa7955a8db4
- Metadata
- sha256:6cebf099e1a159ac2d263f6b3661d5dfb12b223e88ceb53e8663868424be6f96
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:85dab1c3cdbcae54d24768b74e4772f5c1cb3a7116c238d8bbed35bb77597a85
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207