This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| section ‹A Simple Graph Problem› | |
| text ‹ | |
| We shall prove the following: "In a finite group of people, some of whom are friends with some | |
| of the others there must be at least two people who have the same number of friends." | |
| › | |
| theory Friends | |
| imports Main | |
| Finite_Set |