Combinatorics and Graph Theory · Problem 5.1.2

Graph Theory — David Guichard

Mathematics — Combinatorics · graph-theory-basics

Problem

Prove that if ∑i=1ndi\sum_{i=1}^n d_i is even, there is a graph (not necessarily simple) with degree sequence d1,d2,…,dnd_1, d_2, \ldots, d_n.

Related theory

Browse the problem library