Combinatorics and Graph Theory · Problem 5.1.7

Graph Theory — David Guichard

Mathematics — Combinatorics · graph-theory-basics

Problem

Prove that a simple graph with n≥2n \geq 2 vertices has two vertices of the same degree.

Related theory

Browse the problem library