Results 301 to 310 of about 871,047 (310)

Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture

Annals of Mathematics, 2019
In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, Furedi, Graham and ...
Hao-wei Huang
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy