Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Graphs, friends and acquaintances

Autor
Dalfo, C.; Fiol, M.
Tipus d'activitat
Article en revista
Revista
Electronic journal of graph theory and applications
Data de publicació
2018
Volum
6
Número
2
Pàgina inicial
282
Pàgina final
305
Projecte finançador
Combinatorics of networks and computation
Repositori
http://hdl.handle.net/2117/122346 Obrir en finestra nova
URL
http://www.ejgta.org/index.php/ejgta/article/view/324/pdf_83 Obrir en finestra nova
Resum
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),...
Citació
Dalfo, C., Fiol, M. Graphs, friends and acquaintances. "Electronic journal of graph theory and applications", 2018, vol. 6, núm. 2, p. 282-305.
Paraules clau
Hall’s marriage theorem, Menger’s theorem, Ramsey theory, boolean algebra, completely regular code, distance-regularity, edge-coloring
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius