Ramsey Numbers of Connected Clique Matchings

被引：0
作者：
Roberts, Barnaby [1 ]
机构：
[1] London Sch Econ, Dept Math, Houghton St, London WC2A 2AE, England
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2017年 / 24卷 / 01期
关键词：
GRAPHS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We determine the Ramsey number of a connected clique matching. That is, we show that if G is a 2-edge-coloured complete graph on (r(2)-r-1)n-r +1 vertices, then there is a monochromatic connected subgraph containing n disjoint copies of K-r for n sufficiently large. This number of vertices cannot be reduced.
引用
收藏
页数：7
相关论文
共 11 条
  • [1] Ramsey-goodness-and otherwise
    Allen, Peter
    Brightwell, Graham
    Skokan, Jozef
    [J]. COMBINATORICA, 2013, 33 (02) : 125 - 160
  • [2] ALLEN PM, UNPUB
  • [3] RAMSEY THEOREMS FOR MULTIPLE COPIES OF GRAPHS
    BURR, SA
    ERDOS, P
    SPENCER, JH
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 209 (AUG) : 87 - 99
  • [4] BURR SA, 1981, J LOND MATH SOC, V24, P405
  • [5] A new upper bound for diagonal Ramsey numbers
    Conlon, David
    [J]. ANNALS OF MATHEMATICS, 2009, 170 (02) : 941 - 960
  • [6] SOME REMARKS ON THE THEORY OF GRAPHS
    ERDOS, P
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1947, 53 (04) : 292 - 294
  • [7] Erdos P., 1935, Compositio Math., V2, P463
  • [8] Graham RL, 2000, J GRAPH THEOR, V35, P176, DOI 10.1002/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO
  • [9] 2-C
  • [10] Gyarfas A., 2015, ARXIV150905530
12