On graphs with Ramsey-infinite blocks (Q1066916)

We write \(F\to (G,H)\) if when the edges of the graph F are colored red and blue either the red subgraph contains a copy of the graph G or the blue subgraph contains a copy of H. Then F is (G,H)-minimal if \(F\to (G,H)\) but for every subgraph F' of F we have \(F'\nrightarrow (G,H)\). The pair (G,H) is Ramsey-infinite if the set of (G,H)-minimal graphs is infinite. This paper proves the following: Let \(G_ 1,...,G_ r\) and \(H_ 1,...,H_ s\) be the blocks of G and H; then if every pair \((G_ i,H_ j)\) is Ramsey-infinite so is the pair (G,H).