Erdős problem 184
Any graph on vertices can be decomposed into many edge-disjoint cycles and edges.
- Formal statements
- 2 open · 4 solved
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 6 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained