A Ramsey-type theorem for bipartite graphs. Cut-sets in infinite graphs and partial orders. Embedding finite graphs into graphs colored with infinitely many colors. Israel J. Math.
Ramsey graphs contain many distinct induced subgraphs.
On the number of distinct induced subgraphs of a graph. Embedding graphs into colored graphs. Coloring graphs with locally few colors. Chromatic number of finite and infinite graphs and hypergraphs. On set-systems having large chromatic number and not containing prescribed subsystems.