- Tytuł:
- On 1-dependent ramsey numbers for graphs
- Autorzy:
-
Cockayne, E.
Mynhardt, C. - Powiązania:
- https://bibliotekanauki.pl/articles/744249.pdf
- Data publikacji:
- 1999
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
1-dependence
irredundance
CO-irredundance
Ramsey numbers - Opis:
- A set X of vertices of a graph G is said to be 1-dependent if the subgraph of G induced by X has maximum degree one. The 1-dependent Ramsey number t₁(l,m) is the smallest integer n such that for any 2-edge colouring (R,B) of Kₙ, the spanning subgraph B of Kₙ has a 1-dependent set of size l or the subgraph R has a 1-dependent set of size m. The 2-edge colouring (R,B) is a t₁(l,m) Ramsey colouring of Kₙ if B (R, respectively) does not contain a 1-dependent set of size l (m, respectively); in this case R is also called a (l,m,n) Ramsey graph. We show that t₁(4,5) = 9, t₁(4,6) = 11, t₁(4,7) = 16 and t₁(4,8) = 17. We also determine all (4,4,5), (4,5,8), (4,6,10) and (4,7,15) Ramsey graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 1999, 19, 1; 93-110
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł