The planar Ramsey number PR(K₄-e,K₅)

DOI10.1016/J.DISC.2006.05.034MaRDI QIDQ861805zbMATH OpenOpenAlexFDO

Authors Yongqi Sun, Yuansheng Yang, Jing Qiao, Xiaohui Lin

Publication date 2 February 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.05.034

zbMATH Keywords

forbidden subgraphplanar graphRamsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

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\).

Recommendations

• The planar Ramsey numbers PR(K₄-e,K_k-e).
• The planar Ramsey number for C₄ and K₅ is 13
• The planar Ramsey number PR(C₄,K₇)
• Planar Ramsey numbers for small graphs
• Complete graph-tree planar Ramsey numbers

Cites work

• R(4, 5) = 25
• A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
• scientific article; zbMATH DE number 3724498 (Why is no real title available?)
• Parallel concepts in graph theory
• Planar Ramsey Numbers
• Planar Ramsey numbers
• The Analogue of Ramsey Numbers for Planar Graphs
• The planar Ramsey number for C₄ and K₅ is 13

Cited in

(9)

• Planar Ramsey numbers
• On induced Ramsey numbers
• Complete graph-tree planar Ramsey numbers
• The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\)
• The planar Ramsey numbers PR(K₄-e,K_k-e).
• Planar Ramsey numbers for small graphs
• Planar Ramsey Numbers
• The planar Ramsey number for C₄ and K₅ is 13
• The planar Ramsey number PR(C₄,K₇)

This page was built for publication: The planar Ramsey number \(PR(K_4-e,K_5\))

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861805)