The Homomorphism Domination Exponent

Details The Homomorphism Domination Exponent The Homomorphism Domination Exponent

2010-04-14

arxiv.org/abs/1004.2485v1

Mathematics

Combinatorics

23 pages

Scientific paper

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)| \geq |Hom(G,T)|^c for every graph T. The problem of determining whether HDE(F,G) \geq 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 lower bounds and isolating classes of graphs F and G for which HDE(F,G) is computable. In particular, we present a linear program computing HDE(F,G) in the special case where F is chordal and G is series-parallel.

Affiliated with

Also associated with

No associations

Rating

The Homomorphism Domination Exponent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Homomorphism Domination Exponent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Homomorphism Domination Exponent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528419