Intersections of graphs


Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this article is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of Erdös, Goldberg, Pach and Spencer. © 2011 Wiley Periodicals, Inc.

Publication Title

Journal of Graph Theory