Minimal Ramsey graphs on deleting stars for generalized fans and books

Yan Li, Yusheng Li and Ye Wang

Applied Mathematics and Computation, 2020, vol. 372, issue C

Abstract: 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.

Keywords: Critical Ramsey number; Regularity; Stability (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319309981
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:372:y:2020:i:c:s0096300319309981

DOI: 10.1016/j.amc.2019.125006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().