Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Guichard-Combinatorics-Graph-Theory
· Problem 5.1.7
Graph Theory
Mathematics — Probability · graph-theory-basics
Problem
Prove that a simple graph with
n
≥
2
n \geq 2
n
≥
2
vertices has two vertices of the same degree.
Related theory
Graph Theory
Browse the problem library