WorksMathematics
Ramsey goodness of large generalized fans
Abstract
Given graphs and , the Ramsey number is the smallest integer such that any red-blue edge coloring of contains a red copy of or a blue copy of . If is connected, Burr's lower bound gives , where is the minimum size of a color class over all proper -colorings of . The graph is called -good if equality holds in this bound. Liu and Li [J. Graph Theory, 2025] characterized the graphs with for which is -good for and sufficiently large , and posed the corresponding problem for . We solve this problem by showing that for a graph with and , a graph of order and sufficiently large , is -good if and only if when is odd, or when is even, for some positive integer .