Learn More
Define f (k, l) as the least integer so that every graph having f(k, 1) vertices contains either a complete graph of order k or a set of l independent vertices (a complete graph of order k is a graph(More)
In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a(More)