Interesting Esoterica

Graphs, friends and acquaintances

Article by C. Dalfó and M. A. Fiol
  • Published in 2016
  • Added on
As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs made reference to relationships between people or groups of people. In this article, we comment on four results of this kind, which are related to various general theories on graphs and their applications: the Handshake lemma (related to graph colorings and Boolean algebra), a lemma on known and unknown people at a cocktail party (to Ramsey theory), a theorem on friends in common (to distance-regularity and coding theory), and Hall's Marriage theorem (to the theory of networks). These four areas of graph theory, often with problems which are easy to state but difficult to solve, are extensively developed and currently give rise to much research work. As examples of representative problems and results of these areas, which are discussed in this paper, we may cite the following: the Four Colors Theorem (4CTC), the Ramsey numbers, problems of the existence of distance-regular graphs and completely regular codes, and finally the study of topological proprieties of interconnection networks.

Links


BibTeX entry

@article{Graphsfriendsandacquaintances,
	title = {Graphs, friends and acquaintances},
	abstract = {As is well known, a graph is a mathematical object modeling the existence of
a certain relation between pairs of elements of a given set. Therefore, it is
not surprising that many of the first results concerning graphs made reference
to relationships between people or groups of people. In this article, we
comment on four results of this kind, which are related to various general
theories on graphs and their applications: the Handshake lemma (related to
graph colorings and Boolean algebra), a lemma on known and unknown people at a
cocktail party (to Ramsey theory), a theorem on friends in common (to
distance-regularity and coding theory), and Hall's Marriage theorem (to the
theory of networks). These four areas of graph theory, often with problems
which are easy to state but difficult to solve, are extensively developed and
currently give rise to much research work. As examples of representative
problems and results of these areas, which are discussed in this paper, we may
cite the following: the Four Colors Theorem (4CTC), the Ramsey numbers,
problems of the existence of distance-regular graphs and completely regular
codes, and finally the study of topological proprieties of interconnection
networks.},
	url = {http://arxiv.org/abs/1611.07462v2 http://arxiv.org/pdf/1611.07462v2},
	year = 2016,
	author = {C. Dalf{\'{o}} and M. A. Fiol},
	comment = {},
	urldate = {2020-11-25},
	archivePrefix = {arXiv},
	eprint = {1611.07462},
	primaryClass = {math.HO},
	collections = {attention-grabbing-titles,easily-explained}
}