Ramsey numbers of cubes versus cliques
The cube graph Q[subscript n] is the skeleton of the n-dimensional cube. It is an n-regular graph on 2[superscript n] vertices. The Ramsey number r(Q[subscript n] ;K[subscript s]) is the minimum N such that every graph of order N contains the cube graph Q[subscript n] or an independent set of order...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag/Bolyai Society,
2015-01-13T22:22:18Z.
|
Subjects: | |
Online Access: | Get fulltext |