On Ramsey graphs without bipartite subgraphs (Q1197030): Difference between revisions

Let \(G\) and \(H\) be graphs; the autors write \(G\to(H)\) to indicate that, given any 2-coloring of the edges of \(G\), there exists a monochromatic subgraph \(G\) isomorphic to \(H\). The main result of this paper is: Theorem 4. Let \(m,n\leq 2\) be positive integers. Then for every triangle- free graph \(H\) without \(K_{m,n}\) there exists a triangle-free graph \(G\) without \(K_{m,n}\) so that \(G\to(H)\). If \(H\) is bipartite, then \(G\) may be chosen to be bipartite.