Skip to content

Erdős problem 1077

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:82bf58407bc0b4db8dc7723d93bbd4841ebf3096b53aa1d27bffd58aafcc93d2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page