Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture
Work
Year: 2019
Type: article
Abstract: 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 is the best possible result, and it improves a loga... more
Source: Annals of Mathematics
Author Hao Huang
Institution Emory University
Cites:
Cited by: 110
Related to: 10
FWCI: 13.68
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green