Polarity graphs and Ramsey numbers for [formula omitted] versus stars.
- 点击量:
- 作者：Zhang, Xuemei
- 所属单位：数理与信息工程学院
- 文献类型：期刊
- 发表时间：2017-01-01
- 发表刊物：Discrete Mathematics
- 卷号：Vol.340
- 期号：No.4
- 页面范围：655-660
- Issn号：0012-365X
- 是否译文：否
- 关键字：RAMSEY;theory;*FINITE;fields;(Algebra);*QUADRILATERALS;*VERTICES;(Geometry);*STATISTICAL;matching
- 摘要：For two given graphs G 1 and G 2 , the Ramsey number R ( G 1 , G 2 ) is the smallest integer N such that for any graph of order N , either G contains a copy of G 1 or its complement contains a copy of G 2 . Let C m be a cycle of length m and K 1 , n a sta
推荐此文
