Trichotomy and tKm‐Goodness of Sparse Graphs

Le résumé fourni par la source

ABSTRACT Let be a connected graph with vertices and edges and denote the disjoint union of complete graphs . In this paper, by developing a trichotomy for sparse graphs, we show that for given integers and , there exists a positive constant such that if and is large, then is ‐good, that is, the Ramsey number is In particular, the above equality holds for any positive integers , and , provided is large. The case was obtained by Burr, Erdős, Faudree, Rousseau, and Schelp, and the case was established by Luo and Peng.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.