Ramsey properties of generalised irredundant sets in graphs (Q5937582): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00311-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028246501 / rank | |||
Normal rank |
Latest revision as of 10:22, 30 July 2024
scientific article; zbMATH DE number 1619833
Language | Label | Description | Also known as |
---|---|---|---|
English | Ramsey properties of generalised irredundant sets in graphs |
scientific article; zbMATH DE number 1619833 |
Statements
Ramsey properties of generalised irredundant sets in graphs (English)
0 references
8 January 2002
0 references
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.
0 references
generalized irredundance
0 references
generalized Ramsey numbers
0 references