Abstract
It is not known who first raised the following problem or who gave it its human touch. Here it is:
Suppose in a group of people we have the situation that any pair of persons have precisely one common friend. Then there is always a person (the “politician”) who is everybody’s friend.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Erdős, A. RÉnyi & V. SÓs: On a problem of graph theory, Studia Sci. Math. 1 (1966), 215–235.
A. Kotzig: Regularly k-path connected graphs, Congressus Numerantium 40 (1983), 137–141.
A. Kostochka: The nonexistence of certain generalized friendship graphs, in: “Combinatorics” (Eger, 1987), Colloq. Math. Soc. János Bolyai 52, North-Holland, Amsterdam 1988, 341–356.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2001). Of friends and politicians. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04315-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-04315-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04317-2
Online ISBN: 978-3-662-04315-8
eBook Packages: Springer Book Archive