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
How a contribution reaches this record
Seven steps, in four places.
Read the sources and their formal declarations.
PublicWork on it, wherever you work.
Your machineKeep an Approach and its Attempts here.
Needs an accountAttach evidence by its content root.
Needs an accountPrepare an unsigned Submission draft.
Needs an accountSign it with your own key.
Your machineThe Repository decides.
The Repository
Reported activity
Reported by these sources. Not reviewed here.
construction
- Machine
- Reported outcome