Skip to content

Erdős problem 1077

Start work

We call a graph DD-balanced (or DD-almost-regular) if the maximum degree is at most DD times the minimum degree.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:de16db06800e6048ca291242a329742d03cbec77eda39d06bbd9765f55c09755
Metadata
sha256:eacc89f28d8e90ada6a84d6663b1bbd40329818a6154d08e34932120b10c1ed8
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:82bf58407bc0b4db8dc7723d93bbd4841ebf3096b53aa1d27bffd58aafcc93d2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON