母驴舒吧 关注:7贴子:1,025
  • 2回复贴,共1

On computing R(5,5)

只看楼主收藏回复



IP属地:上海1楼2016-10-23 22:07回复
    If R(5,5)=48, each vertex must be (23,24) colored.
    Proof:
    Suppose vertex X is not (23,24) colored.
    Then there must be a color A used >=25 times. Denote the other color B.
    Denote the set of vertices connected with X by color A as Y. By definition, |Y|>=25.
    Thus Y must contain a K4 with color A, or a K5 with color B. Either of them contradicts R(5,5).


    IP属地:上海2楼2016-10-23 23:58
    回复
      https://αrxiv.οrg/pdf/1703.08768.pdf


      IP属地:上海4楼2017-03-31 15:37
      回复