Return to search

Counting, modular counting and graph homomorphisms

A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this thesis we study the complexity of various problems related to graph homomorphisms.

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:729929
Date January 2016
CreatorsMagkakis, Andreas Gkompel
ContributorsGoldberg, Leslie Ann
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttps://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0

Page generated in 0.0017 seconds