Ramsey numbers of paths and graphs of the same order

TL;DR

This paper investigates the Ramsey numbers of paths and graphs of the same order, establishing conditions under which paths are asymptotically G-good based on the maximum degree and independence number of the graphs.

Contribution

It introduces the concept of G-good graphs and provides asymptotic results for paths relative to graphs with bounded maximum degree and limited independence number.

Findings

Paths are asymptotically G-good when the independence number is at most n/4.

The paper characterizes G-goodness in terms of Ramsey numbers and graph colorings.

Results apply to graphs with bounded maximum degree, extending previous knowledge.

Abstract

For graphs $F_n$ and $G_n$ of order $n$, if $R(F_n, G_n)=(\chi(G_n)-1)(n-1)+\sigma(G_n)$, then $F_n$ is said to be $G_n$-good, where $\sigma(G_n)$ is the minimum size of a color class among all proper vertex-colorings of $G_n$ with $\chi(G_n)$ colors. Given $\Delta(G_n)\le \Delta$, it is shown that $P_n$ is asymptotically $G_n$-good if $\alpha(G_n)\le\frac{n}{4}$.