Skip to content

Erdős problem 184

Start work

Any graph on nn vertices can be decomposed into O(n)O(n) many edge-disjoint cycles and edges.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:8687eb4105609930305ca7cf5cc8f7c2a36ec2ae6a22a02633ec6f8c3de21c90
Metadata
sha256:677b6b3072966fb19999d7787f282d9c16e0f54b87ab14495ae595d7a70731fa
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f85351e44f476410099102d71de45986ba5364224e81934f685991c34ebcb6fe
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON