Sep 13 2019

Departmental Colloquium: A proof of the sensitivity conjecture, by Hao Huang

September 13, 2019

3:00 PM - 3:50 PM


636 SEO


Chicago, IL

Hao Huang (Emory): A proof of the sensitivity conjecture

In the $n$-dimensional hypercube graph, one can easily choose half of the vertices such that they induce an empty graph. However, having even just one more vertex would cause the induced subgraph to contain a vertex of degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, Furedi, Graham and Seymour in 1988. In this talk we will discuss a very short algebraic proof of it.

As a direct corollary of this purely combinatorial result, the sensitivity and degree of every boolean function are polynomially related. This solves an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.

Please click here to make changes to, or delete, this seminar announcement.


James Freitag

Date posted

Aug 23, 2019

Date updated

Aug 23, 2019


Hao Huang | (Emory)