Advanced search
Start date
Betweenand


Graph Homomorphisms

Full text
Author(s):
Cristiane Maria Sato
Total Authors: 1
Document type: Master's Dissertation
Press: São Paulo.
Institution: Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME/SBI)
Defense date:
Examining board members:
Yoshiharu Kohayakawa; Manoel José Machado Soares Lemos; Arnaldo Mandel
Advisor: Yoshiharu Kohayakawa
Abstract

Graph homomorphisms are functions from the vertex set of a graph to the vertex set of another graph that preserve adjacencies. The study of graph homomorphisms is very broad, and there are several lines of research about this topic. In this dissertation, we present results about graph homomorphisms related to convergence of graph sequences and connection matrices of graph parameters. This line of research has been proved to be very rich, not only for its results, but also for the proof techniques. In particular, we highlight the diversity of mathematical tools used, including classical results from Algebra, Probability and Analysis. (AU)