Erdős problem 1077We call a graph DD-balanced (or DD-almost-regular) if the maximum degree is at most DD times the minimum degree.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 10772 retained source recordsCanvaspublic previewSource#1077→ResultNone→Checks0