Ramsey-minimal graphs for forests (Q1166540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ramsey-minimal graphs for forests |
scientific article; zbMATH DE number 3769662
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ramsey-minimal graphs for forests |
scientific article; zbMATH DE number 3769662 |
Statements
Ramsey-minimal graphs for forests (English)
0 references
1982
0 references
It is shown that the pair \((G,H)\) is Ramsey, infinite when both \(G\) and \(H\) are forests with at least one of \(G\) or \(H\) having a non-star component. This complements: the same authors, Discrete Math. 33, 227-237 (1981; Zbl 0456.05046) and \textit{J. Nešetřil, V. Rödl} [Colloq. Int. CNRS No 260, 307-308 (1978; Zbl 0409.05044)].
0 references
non-star component
0 references
Ramsey-infinite pair
0 references
