Ramsey properties of generalised irredundant sets in graphs (Q5937582): Difference between revisions

A Boolean function \(f\) is defined for the vertices of a given graph \(G\) which can be viewed as a measure for the existence of certain neighborhood structures in \(G\). If a subset \(S\) of the vertices of \(G\) is called an \(f\)-set whenever \(f(s)=1\) for all \(s\) in \(S\), special cases of \(f\) allow the identification of independent sets, irredundant sets and CO-irredundant sets of \(G\), respectively. Analogues of the classical Ramsey numbers involving \(f\)-sets are defined and the existence of the resulting \(f\)-Ramsey numbers is proven for certain classes of Boolean functions. Moreover, it is shown that some \(f\)-Ramsey numbers satisfy the recurrence inequality known for the classical Ramsey numbers.