The planar Ramsey number \(PR(K_4-e,K_5\))
type: Item
instance of: scholarly article
title: The planar Ramsey number \(PR(K_4-e,K_5\))
zbMATH Open document ID: 1113.05067
author: Yongqi Sun
author: Yuansheng Yang
author: Jing Qiao
author: Xiaohui Lin
published in: Discrete Mathematics
publication date: 2007-02-02T00:00:00Z
review text: The planar Ramsey number \(PR(H_1,H_2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains a copy of \(H_1\) or its complement contains a copy of \(H_2\). In the paper it is shown that \(PR(K_4-e,K_5)=14\); thus, \(PR(K_4-e,K_5)<R(K_4-e,K_5)=16\).
reviewed by: Lorenz Halbeisen
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 5121358
zbMATH Keywords: planar graph
zbMATH Keywords: Ramsey number
zbMATH Keywords: forbidden subgraph
MaRDI profile type: Publication
full work available at URL: j.disc.2006.05.034
OpenAlex ID: W2750397213
cites work: A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
cites work: The planar Ramsey number for \(C_4\) and \(K_5\) is 13
cites work: Q3912621
cites work: Planar Ramsey Numbers
cites work: Parallel concepts in graph theory
cites work: R(4, 5) = 25
cites work: Planar Ramsey numbers
cites work: The Analogue of Ramsey Numbers for Planar Graphs
DOI: 10.1016/J.DISC.2006.05.034
description: scientific article; zbMATH DE number 5121358