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 paper 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˝os, Goldberg, Pach and Spencer.

• Type: Journal
• Year: 2011
• Where: JGT
• Authors: Béla Bollobás, Alex D. Scott
• Keywords: Common Vertex, Conjecture, JGT 2011, Spencer