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 .
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
construction
- Machine
- Reported outcome