Lower Bounds for the Graph Homomorphism Problem. Fomin, F. V., Golovnev, A., Kulikov, A. S., & Mihajlin, I. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 481-493, 2015.
Lower Bounds for the Graph Homomorphism Problem [link]Paper  bibtex   
@inproceedings{ dblp1799579,
  title = {Lower Bounds for the Graph Homomorphism Problem},
  author = {Fedor V. Fomin and Alexander Golovnev and Alexander S. Kulikov and Ivan Mihajlin},
  author_short = {Fomin, F. V. and Golovnev, A. and Kulikov, A. S. and Mihajlin, I.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2015},
  key = {dblp1799579},
  id = {dblp1799579},
  biburl = {http://www.dblp.org/rec/bibtex/conf/icalp/FominGKM15},
  url = {http://dx.doi.org/10.1007/978-3-662-47672-7_39},
  conference = {ICALP},
  pages = {481-493},
  text = {ICALP 2015:481-493},
  booktitle = {Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)}
}

Downloads: 0