On Star-critical (K1,n,K1,m + e) Ramsey numbers

C. J. Jayawardene, J. N. Senadheera, K. A. S. N. Fernando +1

Let $G,H$ be finite graphs without loops or multiple edges and $K_n$ denote the complete graph on $n$ vertices. If for every red/blue colouring of edges of the complete graph $K_n…