ON t-EDGE COLORED COMPLETE GRAPH Kn OF ORDER n

被引：0
|
作者：
李炯生
黄国勋
机构：
[1] Hefei
[2] Guangzi University
[3] University of Science and Technology of China
[4] Nanning
来源：
A Monthly Journal of Science | 1983年 / 07期
关键词：
RI; ON t-EDGE COLORED COMPLETE GRAPH K_n OF ORDER n;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A complete graph Kof order n is called a t-edge colored one if its edges can be colored by t colors. The Ramsey number n (F, …, F) of graphs F, i=1, 2, …, t, is the smallest positive integer n such that for some color i, an i-colored Fcan be found as subgraph of any t-edge colored complete graph K. When F=F=…F=K, we denote n(K,…, K) = r. Generalizing some results obtained by R. E. Greenwood and A. M. Gleason in 1955, we ob-
引用
收藏
页码：1000 / 1000
页数：1
相关论文
共 50 条
  • [1] ON T-EDGE COLORED COMPLETE GRAPH KN OF ORDER N
    LI, JS
    HUANG, GX
    KEXUE TONGBAO, 1983, 28 (07): : 1000 - 1000
  • [2] On the genus of the complete tripartite graph Kn,n,1
    Kurauskas, Valentas
    DISCRETE MATHEMATICS, 2017, 340 (03) : 508 - 515
  • [3] T-colorings and T-edge spans of graphs
    Hu, SJ
    Juan, ST
    Chang, GJ
    GRAPHS AND COMBINATORICS, 1999, 15 (03) : 295 - 301
  • [4] Rainbow short linear forests in edge-colored complete graph
    He, Menglu
    Jin, Zemin
    DISCRETE APPLIED MATHEMATICS, 2025, 361 : 523 - 536
  • [5] Properly Colored Cycles in Edge-Colored 2-Triangle-Free Complete Graph
    Guo, Shanshan
    Huang, Fei
    Yuan, Jinjiang
    Ng, Chi To
    Cheng, T.C.E.
    SSRN, 2022,
  • [6] T-Colorings and T-Edge Spans of Graphs
    Shin-Jie Hu
    Su-Tzu Juan
    Gerard J. Chang
    Graphs and Combinatorics, 1999, 15 : 295 - 301
  • [7] Biclique Cover of Complete Graph Kn and Honeycomb Network HC(n)
    Quadras, Jasintha
    Vasanthika, S.
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT II, 2011, 252 : 151 - 158
  • [8] On the number of genus embeddings of complete tripartite graph Kn,n,l
    Shao, Zeling
    Liu, Yanpei
    ARS COMBINATORIA, 2012, 104 : 129 - 142
  • [9] On Component Order Edge Connectivity Of a Complete Bipartite Graph
    Gross, Daniel
    Karmierczak, L. William
    Saccoman, John T.
    Suffel, Charles
    Suhartomo, Antonius
    ARS COMBINATORIA, 2013, 112 : 433 - 448
  • [10] ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES
    Lang, Richard
    Schaudt, Oliver
    Stein, Maya
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 1374 - 1402
12345