Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (Q1375696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1102605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of graphs that exclude a tree and a clique and are not vertex Ramsey |
scientific article; zbMATH DE number 1102605 |
Statements
Classes of graphs that exclude a tree and a clique and are not vertex Ramsey (English)
0 references
11 January 1998
0 references
It is shown that if \(k\) is large enough depending on \(r\), \(q\) then the class \(\text{Forb}\bigl(T(k,r),K_q\bigr)\) fails to have the Ramsey property. Here \(K_q\) is the clique on \(q\) vertices and \(T(k,r)\) is the tree with radius \(r\) and with degrees \(k+1\) (except for the leaves).
0 references
Ramsey graphs
0 references
0.8301342129707336
0 references
0.8290367722511292
0 references
0.8063214421272278
0 references
