Abstract

AbstractWe close a gap in the proof of Theorem 4.1 in our paper “The complexity of counting graph homomorphisms” [Random Structures Algorithms 17 (2000), 260–289]. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004

Full Text
Published version (Free)

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 call