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 .
Nothing has been recorded here yet.
How far the record reaches2 of 6 stages
- Sourceerdos-problems
- StatementRetained
- FormalNone associated
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingFormal declaration
No formal declaration is associated with this question.
A formal statement is the first thing a check can run against.
Where the source files it274 share a topic
None carries a Standing. Browse the topic.