On Ramsey minimal graphs (Q5917560): 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/j.disc.2003.11.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045643193 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 2105608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Ramsey minimal graphs |
scientific article; zbMATH DE number 2105608 |
Statements
On Ramsey minimal graphs (English)
0 references
1 October 2004
0 references
Let \(G,F\) and \(H\) be graphs. Then \(G\) is \(\left( F,H\right) \)-Ramsey minimal if any colouring of the edges of \(G\) in red and blue yields a red copy of \(F\) or a blue copy of \(H\), but no proper subgraph of \(G\) has this property. This paper gives two equivalent theorems which characterize the \(\left( K_{1,2},K_{1,m}\right) \) Ramsey minimal graphs.
0 references
Ramsey minimal graphs
0 references
1-factor
0 references
