Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture
.
(2019)cite arxiv:1907.00847.

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 $n$. This result is best possible, and improves a logarithmic lower bound shown by Chung, Füredi, Graham and Seymour in 1988. As a direct consequence, we prove that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.
  • @kirk86
  • @dblp
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).