Erdős problem 1077
We call a graph -balanced (or -almost-regular) if the maximum degree is at most times the minimum degree.
- Formal statements
- 1 solved
- Erdős Problems says
- disproved
- Decision here
- No current contribution
- Checks
- 0 checks · 1 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained