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 .
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:85dab1c3cdbcae54d24768b74e4772f5c1cb3a7116c238d8bbed35bb77597a85
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb