On a property of the n-dimensional cube
Abstract
We show that in any subset of the vertices of n-dimensional cube that contains at least 2n-1+1 vertices (n≥ 4), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.