School Seminars and Colloquia

Spectral Graph Theory (XXI): The Friendship Theorem

Discrete Structures and Algorithms (Reading Group)

by David Wood

Institution: The University of Melbourne
Date: Wed 26th September 2012
Time: 10:00 AM
Location: Room 107, Richard Berry Building

Abstract: The purpose of this talk is to give an example of the application of algebraic methods to prove a purely graph-theoretic result. In particular, I will prove the following "Friendship Theorem": In a group of people, if every pair of people has exactly one common friend, then one person is everyone's friend.