In this paper, we determine the Gallai–Ramsey numbers for C7. We state and prove our main result in Section 2. Very recently, Gallai–Ramsey numbers of odd cycles of length at least 9 have been completely settled by Bosse and Song [2] for C9 and C11, Bosse, Song and Zhang [3] for...
Unlike Ramsey number of odd cycles, little is known about the general behavior of $R_k(C_{2n})$ except that $R_k(C_{2n})\\ge (n-1)k+n+k-1$ for all $k\\ge2$ and $n\\ge2$. In this paper, we study Ramsey number of even cycles with chords under Gallai colorings, ...
Magnant, Gallai-Ramsey numbers for monochromatic triangles or 4-cycles, Graphs Combin. 34 (2018), 1315--1324. ^M. Chen, Y.S. Li and C.P. Pei, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Graphs Combin. 34 (2018) 1185–1196. ^Z. Wang, Y. P. Mao, C. ...
学术范收录的Repository A conjecture on Gallai-Ramsey numbers of even cycles and paths,目前已有全文资源,进入学术范阅读全文,查看参考文献与引证文献,参与文献内容讨论。学术范是一个在线学术交流社区,收录论文、作者、研究机构等信息,是一个与小木虫、知乎类似
Pei, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Graphs Combin. (2018). https://doi.org/10.1007/s00373-018-1931-7M. Chen, Y. Li, and C. Pei, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Graphs and Combinatorics 34 (2018), no. 6, 1185-...
M. Chen, Y.S. Li and C.P. Pei, Gallai-Ramsey numbers of odd cycles and complete bipartite graphs, Graphs Combin. (2018). https://doi.org/10.1007/s00373-018-1931-7M. Chen, Y. Li, C. Pei, Gallai-Ramsey numbers of odd cycles and complete bipar- tite graphs, submitted....
For graphs G and H and integer [equation], the Gallai–Ramsey number [equation] is defined to be the minimum integer N such that if [equation] is edge-colored with kcolors, then there is either a...M. Chen, Y.S. Li and C.P. Pei, Gallai-Ramsey numbers of odd cycles and ...
Ozeki, M. Tsugaki, Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles, Journal of Graph Theory, doi: 10.1002/jgt.21723M. Hall, C. Magnant, K. Ozeki, and M. Tsugaki. Improved upper bounds for Gallai-Ramsey numbers of paths and cycles. J. Graph Theory, 75(1):59-...
grk(K3,K3)={5k/2if k is even2⋅5(k−1)/2if k is odd . Concerning the cycle C5, we prove the following theorem. Theorem 8 For any positive integer k≥2,grk(K3:C5)=2k+1+1. We will make use of some classical graph Ramsey numbers in our proofs. (For the details of kno...
A k-hyperedge-coloring of a hypergraph is exact if all colors are used at least once. In this paper, we get the exact values of hypergraph Gallai–Ramsey numbers for rainbow 3-uniform Berge triangles and monochromatic 3-uniform linear paths or cycles under exact k-hyperedge-coloring....