Abstract: Given two simple graphs, the question of whether one graph is homomorphic to another is often discussed. In this talk, we discuss both its computational and structural aspects. From the computational perspective, we are concerned with detecting and counting small, fixed graphs in sparse host graphs. From the structural viewpoint, we are interested in the existence of homomorphism of a given graph to a complete graph.

Meeting id: 948 0044 7244
Passcode: 597063