Minimal vertex Ramsey graphs and minimal forbidden subgraphs (Q1883248)
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 2105607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal vertex Ramsey graphs and minimal forbidden subgraphs |
scientific article; zbMATH DE number 2105607 |
Statements
Minimal vertex Ramsey graphs and minimal forbidden subgraphs (English)
0 references
1 October 2004
0 references
Let \(G,F\) and \(H\) be graphs. Then \(G\) is \((F,H)\)-Ramsey minimal if any colouring of the edges of \(G\) in red and blue yields a blue copy of \(F\) or a red copy of \(H\), but no proper subgraph of \(G\) has this property. This paper gives two equivalent theorems which characterize the \(K_{1,2}, K_{1,m}\) Ramsey minimal graphs.
0 references
generalized vertex colouring
0 references
hereditary properties
0 references
vertex Ramsey minimal graphs
0 references
minimal forbidden subgraphs
0 references
0.9614198207855223
0 references
0.899793267250061
0 references
0.892353892326355
0 references
0.8912596702575684
0 references
0.8726439476013184
0 references
