Seminar series
Date
Tue, 20 May 2008
14:30
14:30
Location
L3
Speaker
Ed Marchant
Organisation
Cambridge
Let G be the union of a red graph R and a blue graph B where every edge of G is in R or B (or both R and B). We call such a graph 2-painted.
Given 2-painted graphs G and H, we say that G contains a copy of H if we can find a subgraph of G which is isomorphic to H. Let 0