Learn More
Consider a function f : f0;1g n ! f0;1g. The sensitivity of a point v 2 f0;1g n is jfv 0 : f (v 0) 6 = f (v); dist(v; v 0) = 1gj, i.e. the number of neighbors of the point in the discrete cube on which the value of f diiers. The average sensitivity of f is the average of the sensitivity of all points in f0;1g n. (This can also be interpreted as the sum of(More)
We consider powers of regular graphs defined by the weak graph product and give a characterization of maximum-size independent sets for a wide family of base graphs which includes, among others, complete graphs, line graphs of regular graphs which contain a perfect matching and Kneser graphs. In many cases this also characterizes the optimal colorings of(More)
Let f k (n; p) denote the probability that the random graph G(n; p) is k-colorable. We show that for every k 3, there exists d k (n) such that for any > 0, lim n!1 f k (n; d k (n) ? n) = 1 and lim n!1 f k (n; d k (n) + n) = 0 : As a result we conclude that for any given value of n the the chromatic number of G(n; d=n) is concentrated in one value for all(More)
We prove a new lower bound on the randomized decision tree complexity of monotone graph properties. For a monotone graph property $A$ of graphs on $n$ vertices, let $p=p(A)$ denote the threshold probability of $A$, namely the value of $p$ for which a random graph from $G(n,p)$ has property $A$ with probability $1/2$. Then the expected number of queries made(More)
A family J of subsets of {1,. .. , n} is called a j-junta if there exists J ⊆ {1,. .. , n}, with |J| = j, such that the membership of a set S in J depends only on S ∩ J. In this paper we provide a simple description of intersecting families of sets. Let n and k be positive integers with k < n/2, and let A be a family of pairwise intersecting subsets of {1,.(More)
We study the following one-person game against a random graph: the Player's goal is to 2-colour a random sequence of edges e1, e2,. .. of a complete graph on n vertices, avoiding a monochromatic triangle for as long as possible. The game is over when a monochro-matic triangle is created. The online version of the game requires that the Player should colour(More)
A theorem of Bourgain [4] on Fourier tails states that if f :(-1, 1)<sup>n</sup> &#8594; (-1, 1) is a boolean-valued function on the discrete cube such that for any k &gt; 0, [&#931;<sub>|S| &gt; k</sub> f(S)<sup>2</sup> &lt; k<sup>-1/2 + o(1)</sup>, ] then essentially, f depends on only 2<sup>O(k)</sup> coordinates. This and related theorems such as(More)