Erdős problem 184Any graph on nn vertices can be decomposed into O(n)O(n) many edge-disjoint cycles and edges.WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 1847 retained source recordsCanvaspublic previewSource#184→ResultNone→Checks0