典型文献
Gallai-Ramsey Number for the Union of Stars
文献摘要：
Given a graph G and a positive integer k,define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge coloring of Kn contains either a rainbow(all different colored)triangle or a monochromatic copy of G.In this paper,we obtain exact values of the Gallai-Ramsey numbers for the union of two stars in many cases and bounds in other cases.This work represents the first class of disconnected graphs to be considered as the desired monochromatic subgraph.
文献关键词：
中图分类号：
作者姓名：
Ya Ping MAO;Zhao WANG;Colton MAGNANT;Ingo SCHIERMEYER
作者机构：
School of Mathematics and Statistics,Qinghai Normal University,Xining 810008,P.R.China;College of Science,China Jiliang University,Hangzhou 310018,P.R.China;Department of Mathematics,Clayton State University,Morrow,GA,30260,USA;Technische Universit?t Bergakademie Freiberg,Institut für Diskrete Mathematik und Algebra,09596 Freiberg,Germany
文献出处：
引用格式：
[1]Ya Ping MAO;Zhao WANG;Colton MAGNANT;Ingo SCHIERMEYER-.Gallai-Ramsey Number for the Union of Stars)[J].数学学报（英文版）,2022(08):1317-1332
A类：
Gallai
B类：
Ramsey,Number,Union,Stars,Given,positive,integer,define,minimum,vertices,such,that,edge,coloring,Kn,contains,either,rainbow,different,colored,triangle,monochromatic,copy,In,this,paper,we,obtain,exact,values,numbers,union,two,stars,many,cases,bounds,other,This,work,represents,first,class,disconnected,graphs,considered,desired,subgraph
AB值：
0.653192
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
