Ehud Friedgut

2.8k total citations
39 papers, 1.3k citations indexed

About

Ehud Friedgut is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Ehud Friedgut has authored 39 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Discrete Mathematics and Combinatorics, 23 papers in Computational Theory and Mathematics and 17 papers in Geometry and Topology. Recurrent topics in Ehud Friedgut's work include Limits and Structures in Graph Theory (26 papers), Advanced Graph Theory Research (15 papers) and Advanced Topology and Set Theory (9 papers). Ehud Friedgut is often cited by papers focused on Limits and Structures in Graph Theory (26 papers), Advanced Graph Theory Research (15 papers) and Advanced Topology and Set Theory (9 papers). Ehud Friedgut collaborates with scholars based in Israel, United States and United Kingdom. Ehud Friedgut's co-authors include Gil Kalai, Irit Dinur, Dimitris Achlioptas, Noam Nisan, Noga Alon, Jeff Kahn, Vojtěch Rödl, Assaf Naor, Yuval Filmus and David Ellis and has published in prestigious journals such as SIAM Journal on Computing, American Mathematical Monthly and Proceedings of the American Mathematical Society.

In The Last Decade

Ehud Friedgut

35 papers receiving 1.1k citations

Peers

Ehud Friedgut

CTM

DMC

CNC

AI

GT

József Beck United States

J. Spencer United States

William T. Trotter United States

Michał Karoński Poland

Michael Krivelevich Israel

Jin‐Yi Cai United States

James Oxley United States

Douglas R. Woodall United Kingdom

Jörg Flum Germany

Van H. Vu United States

József Beck United States

Ehud Friedgut

590 ×0.7

CTM

392 ×0.8

DMC

80 ×0.2

CNC

168 ×0.5

AI

217 ×0.9

GT

Citations per year, relative to Ehud Friedgut Ehud Friedgut (= 1×) peers József Beck

Countries citing papers authored by Ehud Friedgut

Since Specialization

Citations

This map shows the geographic impact of Ehud Friedgut's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ehud Friedgut with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ehud Friedgut more than expected).

Fields of papers citing papers by Ehud Friedgut

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ehud Friedgut. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ehud Friedgut. The network helps show where Ehud Friedgut may publish in the future.

Co-authorship network of co-authors of Ehud Friedgut

This figure shows the co-authorship network connecting the top 25 collaborators of Ehud Friedgut. A scholar is included among the top collaborators of Ehud Friedgut based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ehud Friedgut. Ehud Friedgut is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Friedgut, Ehud. (2024). An Information-Theoretic Proof of a Hypercontractive Inequality. Entropy. 26(11). 966–966.

2.

Friedgut, Ehud, et al.. (2023). Hyper-regular graphs and high dimensional expanders. Israel Journal of Mathematics. 256(1). 233–267. 2 indexed citations

3.

Alon, Noga, Ehud Friedgut, Gil Kalai, & Guy Kindler. (2023). The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs. SIAM Journal on Discrete Mathematics. 37(4). 2717–2729.

4.

Friedgut, Ehud, et al.. (2017). Chvátal's conjecture and correlation inequalities. Journal of Combinatorial Theory Series A. 156. 22–43. 1 indexed citations

5.

Ellis, David, Yuval Filmus, & Ehud Friedgut. (2014). A quasi-stability result for dictatorships in S n. COMBINATORICA. 35(5). 573–618. 8 indexed citations

6.

Ellis, David, Yuval Filmus, & Ehud Friedgut. (2012). Triangle-intersecting families of graphs. Journal of the European Mathematical Society. 14(3). 841–885. 23 indexed citations

7.

Friedgut, Ehud, et al.. (2011). An Algebraic Proof of a Robust Social Choice Impossibility Theorem. 413–422. 1 indexed citations

8.

Dinur, Irit & Ehud Friedgut. (2008). Intersecting Families are Essentially Contained in Juntas. Combinatorics Probability Computing. 18(1-2). 107–122. 26 indexed citations

9.

Friedgut, Ehud. (2008). On the measure of intersecting families, uniqueness and stability. COMBINATORICA. 28(5). 503–528. 46 indexed citations

10.

Dinur, Irit, Ehud Friedgut, & Oded Regev. (2008). Independent Sets in Graph Powers are Almost Contained in Juntas. Geometric and Functional Analysis. 18(1). 77–97. 18 indexed citations

11.

Friedgut, Ehud, Gil Kalai, & Noam Nisan. (2008). Elections Can be Manipulated Often. 243–249. 65 indexed citations

12.

Friedgut, Ehud, Vojtěch Rödl, Andrzej Ruciński, & Prasad Tetali. (2006). A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Memoirs of the American Mathematical Society. 179(845). 0–0. 10 indexed citations

13.

Dinur, Irit & Ehud Friedgut. (2006). Proof of an Intersection Theorem via Graph Homomorphisms. The Electronic Journal of Combinatorics. 13(1). 3 indexed citations

14.

Friedgut, Ehud, Orna Kupferman, & Moshe Y. Vardi. (2006). BÜCHI COMPLEMENTATION MADE TIGHTER. International Journal of Foundations of Computer Science. 17(4). 851–867. 4 indexed citations

15.

Friedgut, Ehud. (2005). A Katona-type proof of an Erdős–Ko–Rado-type theorem. Journal of Combinatorial Theory Series A. 111(2). 239–244. 3 indexed citations

16.

Friedgut, Ehud. (2004). Influences in Product Spaces: KKL and BKKKL Revisited. Combinatorics Probability Computing. 13(1). 17–29. 19 indexed citations

17.

Friedgut, Ehud. (2004). Hypergraphs, Entropy, and Inequalities. American Mathematical Monthly. 111(9). 749–760. 28 indexed citations

18.

Friedgut, Ehud, Gil Kalai, & Assaf Naor. (2002). Boolean functions whose Fourier transform is concentrated on the first two levels. Advances in Applied Mathematics. 29(3). 427–437. 49 indexed citations

19.

Alon, Noga & Ehud Friedgut. (2000). On the Number of Permutations Avoiding a Given Pattern. Journal of Combinatorial Theory Series A. 89(1). 133–140. 27 indexed citations

20.

Friedgut, Ehud & Jeff Kahn. (1998). On the number of copies of one hypergraph in another. Israel Journal of Mathematics. 105(1). 251–256. 35 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact