Intersections of Graphs

Journal article

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.

Authors: Bollobas, B; Scott, A

• Publication status: Published
• Journal: JOURNAL OF GRAPH THEORY
• Volume: 66
• Issue: 4
• Pages: 261-282
• Publication date: 2011-04-01
• DOI: 10.1002/jgt.20489
• EISSN: 1097-0118
• ISSN: 0364-9024
• Keywords: subgraphs; graph intersections; discrepancy