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 .
Workspace
public preview
- #584
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
construction
- Machine
- Reported outcome