Combinatorics and Graph Theory · Problem 5.7.3

Graph Theory — David Guichard

Mathematics — Combinatorics · connectivity

Problem

Suppose GG is simple with degree sequence d1≤d2≤⋯≤dnd_1 \leq d_2 \leq \cdots \leq d_n, and for k≤n−dn−1k \leq n - d_n - 1, dk≥kd_k \geq k. Show GG is connected.

Browse the problem library