Dec 6, 2012 · In this paper, we investigate the problem of ( k , Q ) -Ramsey classes of graphs, which were introduced in [M. Borowiecki, A. Fiedorowicz, ...
Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently ...
In this note, we introduce the notion of k-Ramsey classes of graphs and we reveal connections to intersection dimensions of graphs. Keywords: graph, ...
Motivated by this difficulty, we establish here exact formulas for all Ramsey numbers for three important subclasses of claw-free graphs: line graphs, long ...
We prove that some important graph classes, such as k -degenerate graphs, k -trees or hom-properties, are ( k , Q ) -Ramsey classes of graphs. We also provide ...
Planar graphs form the only graph class for which all Ramsey numbers have been determined ... Since G is not a fuzzy linear interval graph, q is covered by an ...
Figure 1 illustrates two equivalent depictions of a given graph. All graphs are generally divided into two main classes, simple graphs and multigraphs. The ...
The Ramsey number RX(p, q) for a class of graphs X is the minimum n such that every graph in X with at least n vertices has either a clique of size p or an ...
Ramsey, is a branch of the mathematical field of combinatorics that focuses on the appearance of order in a substructure given a structure of a known size.
A Ramsey class is defined as a hereditary class K of structures which has the A-partition property for every A E K; see [4,6]. This notion generalizes.