Premium
Intersections of graphs
Author(s) -
Bollobás Béla,
Scott Alex
Publication year - 2011
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20489
Subject(s) - combinatorics , conjecture , mathematics , vertex (graph theory) , graph , set (abstract data type) , order (exchange) , discrete mathematics , computer science , finance , economics , programming language
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. J Graph Theory 66:261‐282, 2011