Mostra el registre d'ítem simple

dc.contributor.authorDalfó Simó, Cristina
dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-10-16T08:43:09Z
dc.date.available2018-10-16T08:43:09Z
dc.date.issued2018
dc.identifier.citationDalfo, C., Fiol, M. Graphs, friends and acquaintances. "Electronic journal of graph theory and applications", 2018, vol. 6, núm. 2, p. 282-305.
dc.identifier.issn2338-2287
dc.identifier.urihttp://hdl.handle.net/2117/122346
dc.descriptionPublished in: Electronic journal of graph theory and applications (http://www.ejgta.org)
dc.description.abstractA 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), 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 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.
dc.format.extent24 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.lcshGraph theory
dc.subject.otheredge-coloring
dc.subject.otherboolean algebra
dc.subject.otherRamsey theory
dc.subject.otherdistance-regularity
dc.subject.othercompletely regular code
dc.subject.otherHall’s marriage theorem
dc.subject.otherMenger’s theorem
dc.titleGraphs, friends and acquaintances
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.relation.publisherversionhttp://www.ejgta.org/index.php/ejgta/article/view/324/pdf_83
dc.rights.accessOpen Access
local.identifier.drac23409179
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT
local.citation.authorDalfo, C.; Fiol, M.
local.citation.publicationNameElectronic journal of graph theory and applications
local.citation.volume6
local.citation.number2
local.citation.startingPage282
local.citation.endingPage305


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple