Kevin Cuddy

Learn More
In this paper we present a graph property with sensitivity Θ(√ n), where n = v 2 is the number of variables, and generalize it to a k-uniform hy-pergraph property with sensitivity Θ(√ n), where n = v k is again the number of variables. This yields the smallest sensitivity yet achieved for a k-uniform hypergraph property. We then show that, for even k, there(More)
  • 1