Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Every monotone graph property has a sharp threshold

- E. Friedgut, G. Kalai
- Mathematics
- 1996

In their seminal work which initiated random graph theory Erdos and Renyi discovered that many graph properties have sharp thresholds as the number of vertices tends to infinity. We prove a… Expand

Sharp thresholds of graph properties, and the -sat problem

- E. Friedgut, appendix by Jean Bourgain
- Mathematics
- 27 May 1999

Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be considering subsets of this space defined by monotone graph properties. A monotone… Expand

Boolean Functions With Low Average Sensitivity Depend On Few Coordinates

- E. Friedgut
- Mathematics, Computer ScienceComb.
- 1998

TLDR

On the measure of intersecting families, uniqueness and stability

- E. Friedgut
- Mathematics, Computer ScienceComb.
- 1 September 2008

TLDR

Intersecting Families of Permutations

- David Ellis, E. Friedgut, Haran Pilpel
- Mathematics
- 15 November 2010

A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently… Expand

Intersecting Families are Essentially Contained in Juntas

- Irit Dinur, E. Friedgut
- Computer Science, MathematicsCombinatorics, Probability and Computing
- 1 March 2009

TLDR

A sharp threshold for k-colorability

- D. Achlioptas, E. Friedgut
- Mathematics
- 1999

. ABSTRACT: Let k be a fixed integer and fn , p denote the probability that the random k . . graph Gn , p is k-colorable. We show that for k G 3, there exists dn such that for any k e ) 0, dn y e

Graph Products, Fourier Analysis and Spectral Techniques

- N. Alon, Irit Dinur, E. Friedgut, B. Sudakov
- Mathematics
- 1 October 2004

Abstract.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… Expand

On the number of copies of one hypergraph in another

- E. Friedgut, J. Kahn
- Mathematics
- 1998

AbstractGiven two hypergraphsH andG, letN(G, H) denote the number of subhypergraphs ofG isomorphic toH. LetN(l, H) denote the maximum ofN(G, H), taken over allG with exactlyl edges. In [1] Noga Alon… Expand

Boolean functions whose Fourier transform is concentrated on the first two levels

- E. Friedgut, G. Kalai, A. Naor
- Mathematics, Computer ScienceAdv. Appl. Math.
- 1 October 2002

In this note we describe Boolean functions f(x1,x2,?,xn) whose Fourier coefficients are concentrated on the lowest two levels. We show that such a function is close to a constant function or to a… Expand

...

1

2

3

4

5

...