Abstract
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 ) | c 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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
