|
Organizers |
Extremal problems for counting homomorphisms
by
Jonathan Cutler
Montclair State University
Coauthors: A.J. Radcliffe (University of Nebraska-Lincoln)
There is a close connection between graph homomorphisms and a variety of natural graph theoretic notions: independent sets, colorings, etc. There has been some progress recently concerning extremal problems for counting graph homomorphisms. We will discuss some of this work, including the interesting behavior of a specific extremal problem.
Date received: April 16, 2008
Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caxa-51.