Abstract:Let f1, f2,…, fk be graph parameters.This paper presents an estimation of upper bound of generalized Ramsey numbers r(f1≥n1, f2≥n2,…,fk≥nk) by induction.Based on the definition of the mixed Ramseynumber v(f; m; H),the paper presents an upper bound of the mixed Ramseynumber and an expression of v(f; m; H) when the graph parameter is χF.