Loading...
Loading...

Go to the content (press return)

Graphs, friends and acquaintances

Author
Dalfo, C.; Fiol, M.
Type of activity
Journal article
Journal
Electronic journal of graph theory and applications
Date of publication
2018
Volume
6
Number
2
First page
282
Last page
305
Project funding
Combinatorics of networks and computation
Repository
http://hdl.handle.net/2117/122346 Open in new window
URL
http://www.ejgta.org/index.php/ejgta/article/view/324/pdf_83 Open in new window
Abstract
A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people. In this article, we comment on four results of this kind: 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),...
Citation
Dalfo, C., Fiol, M. Graphs, friends and acquaintances. "Electronic journal of graph theory and applications", 2018, vol. 6, núm. 2, p. 282-305.
Keywords
Hall’s marriage theorem, Menger’s theorem, Ramsey theory, boolean algebra, completely regular code, distance-regularity, edge-coloring
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments