Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JGT
2011

favoriteEmaildiscussreport

76views more JGT 2011»

Intersections of graphs

12 years 11 months ago

Intersections of graphs

Download people.maths.ox.ac.uk

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.

Béla Bollobás, Alex D. Scott

Real-time Traffic

Common Vertex | Conjecture | JGT 2011 | Spencer |

claim paper

Related Content

» Intersection Graphs of Pseudosegments Chordal Graphs

» Method for drawing intersecting clustered graphs and its application to web ontology langu...

» The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs

» Densest kSubgraph Approximation on Intersection Graphs

» 3Dintervalfilament graphs

» Complexity of Some Geometric and Topological Problems

» More on block intersection polynomials and new applications to graphs and block designs

» On the Intersection of Tolerance and Cocomparability Graphs

» A New Intersection Model and Improved Algorithms for Tolerance Graphs

» Spanners for Geometric Intersection Graphs

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	JGT
Authors	Béla Bollobás, Alex D. Scott

Comments (0)