The homomorphism domination exponent

@article{Kopparty2011TheHD,
  title={The homomorphism domination exponent},
  author={Swastik Kopparty and Benjamin Rossman},
  journal={Eur. J. Comb.},
  year={2011},
  volume={32},
  pages={1097-1114}
}
We initiate a study of the homomorphism domination exponent of a pair of graphs F and G, defined as the maximum real number c such that |Hom(F, T )| > |Hom(G,T )| for every graph T . The problem of determining whether HDE(F,G) > 1 is known as the homomorphism domination problem and its decidability is an important open question arising in the theory of relational databases. We investigate the combinatorial and computational properties of the homomorphism domination exponent, proving upper and… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS