Minimal vertex Ramsey graphs and minimal forbidden subgraphs
type: Item
instance of: scholarly article
title: Minimal vertex Ramsey graphs and minimal forbidden subgraphs
zbMATH Open document ID: 1060.05069
author: Marta Borowiecka-Olszewska
author: Ewa Drgas-Burchardt
author: Peter Mihók
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
review text: 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.
reviewed by: Marietjie Frick
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 2105607
zbMATH Keywords: generalized vertex colouring
zbMATH Keywords: hereditary properties
zbMATH Keywords: vertex Ramsey minimal graphs
zbMATH Keywords: minimal forbidden subgraphs
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.042
OpenAlex ID: W2024297585
cites work: Minimal forbidden subgraphs of reducible graph properties
cites work: A survey of hereditary properties of graphs
cites work: Extremal results on defective colorings of graphs
cites work: 25 pretty graph colouring problems
cites work: Q5528475
cites work: Q5632599
DOI: 10.1016/J.DISC.2003.11.042
description: scientific article; zbMATH DE number 2105607