Minimal Ramsey graphs on deleting stars for generalized fans and books
作者：
Highlights：
•
摘要
Let F, G1 and G2 be simple graphs. Denote by F → (G1, G2) each edge coloring of F by red and blue that contains a red G1 or a blue G2. Define the star-critical Ramsey number RS(G1,G2) to be the largest p such that Kr∖K1,p → (G1, G2), where r=R(G1,G2) is the Ramsey number. By Stability Lemma and Regularity Lemma, we determine RS(C2t+1,K1+nG) and RS(C2t+1,Ks+nK1) for large n.
论文关键词：Critical Ramsey number,Regularity,Stability
论文评审过程：Received 16 July 2019, Revised 10 December 2019, Accepted 22 December 2019, Available online 8 January 2020, Version of Record 8 January 2020.
论文官网地址：https://doi.org/10.1016/j.amc.2019.125006
