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: | en_US |
| Published: |
Springer-Verlag/Bolyai Society
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92844 https://orcid.org/0000-0002-5798-3509 |