暂无分享,去创建一个
We show that in any subset of the vertices of $n$-dimensional cube that contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.
[1] D. West. Introduction to Graph Theory , 1995 .
[2] Frank Harary,et al. Graph Theory , 2016 .