Generalized local colorings of graphs (Q1193560)

Let \(k\) be a fixed positive integer and let \(H\) be a graph with at least \(k+1\) edges. A local \((H,k)\)-coloring of a graph \(G\) is a coloring of the edges of \(G\) such that edges of no subgraph of \(G\) isomorphic to a subgraph of \(H\) are colored with more than \(k\) colors. In the paper, the properties of local \((H,k)\)-colorings are investigated. It is proved that the Ramsey property for such colorings holds. The conditions are established for the density property and the bipartite version of the Ramsey theorem to hold. Finally, the induced variant of the Ramsey theorem with forbidden large cliques is proved.