Sudakov, Benjamin - Department of Mathematics, University of California at Los Angeles

• On the Asymmetry of Random Regular Graphs and Random Graphs
• Journal of Combinatorial Theory, Series B 86, 2737 (2002) doi:10.1006/jctb.2002.2110
• LEARNING A HIDDEN MATCHING NOGA ALON, RICHARD BEIGEL, SIMON KASIF,
• * UCLA Combinatorics Seminar * Date: Thursday, October 14, 1.50-2.50 in Room 7608
• * UCLA Combinatorics Seminar * Date: Thursday, March 5, 1.50-2.50 in MS 7608
• (n, d, )-graphs: properties and applications
• All-Pairs Shortest Paths in O(n2 ) time with high probability
• ICM 2002 Vol. III 587{603 List colouring of graphs with at most
• Z .Journal of Algorithms 41, 99 113 2001 doi:10.1006rjagm.2001.1173, available online at http:rrwww.idealibrary.com on
• Journal of Combinatorial Theory, Series B 97 (2007) 904918 www.elsevier.com/locate/jctb
• Combinatorics, Probability and Computing (2002) 11, 465474. c 2002 Cambridge University Press DOI: 10.1017/S0963548302005199 Printed in the United Kingdom
• Asymptotically optimal tree-packings in regular graphs Alexander Kelmans
• Generating all subsets of a finite set with disjoint unions David Ellis
• * UCLA Combinatorics Seminar * Date: Thursday, February 25, 1.50-2.50 in Room 5148
• Discrete Kakeya-type problems and small bases
• Journal of Combinatorics Volume 1, Numbers 34, 345356, 2010
• COMBINATORICA Bolyai Society Springer-Verlag
• Combinatorics, Probability and Computing (2009) 18, 247258. c 2007 Cambridge University Press doi:10.1017/S0963548307008875 Printed in the United Kingdom
• Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors
• * UCLA/IPAM Combinatorics Seminar * Date: Thursday, November 12, 1.502.50 in IPAM Room 1200
• * UCLA Combinatorics Seminar * Date: Thursday, May 26, 1.50-2.50 in Room 5217
• * UCLA Combinatorics Seminar * Date: Thursday, February 5, 1.50-2.50 in MS 7608
• http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 88 (2003) 99106
• Combinatorics, Probability and Computing (2003) 12, 477494. c 2003 Cambridge University Press DOI: 10.1017/S0963548303005741 Printed in the United Kingdom
• * UCLA Combinatorics Seminar * Date: Thursday, January 22, 1.50-2.50 in MS 7608
• COMBINATORICA Bolyai Society Springer-Verlag
• * UCLA Combinatorics Seminar * Date: Thursday, November 4, 1.50-2.50 in Room 7608
• * UCLA Combinatorics Seminar * Date: Thursday, April 3, 1.50-2.50 in Room 6943
• ISRAEL JOURNAL OF MATHEMATICS 181 (2011), 423432 DOI: 10.1007/s11856-011-0016-6
• COMBINATORICA Bolyai Society Springer-Verlag
• H-free graphs of large minimum degree Benny Sudakov
• CONSTRUCTING WORST CASE INSTANCES FOR SEMIDEFINITE PROGRAMMING BASED APPROXIMATION ALGORITHMS
• A Note on Critical Linear Hypergraphs Benny Sudakov \Lambda
• COMBINATORICA Bolyai Society Springer-Verlag
• Getting directed Hamilton cycle twice faster Choongbum Lee
• Journal of Combinatorial Theory, Series B 81, 209 223 (2001) Nowhere-Zero Flows in Random Graphs
• Induced Subgraphs of Prescribed Size
• * UCLA Combinatorics Seminar * Date: Thursday, April 1, 1.50-2.50 in Room 6229
• Combinatorics, Probability and Computing (2009) 18, 775801. c 2009 Cambridge University Press doi:10.1017/S0963548309990356 Printed in the United Kingdom
• * UCLA Colloquium * Date: Thursday, November 18, 13:50-14:50 in MS 7608
• Advances in Mathematics 227 (2011) 16121645 www.elsevier.com/locate/aim
• COMBINATORICA Bolyai Society Springer-Verlag
• A bound for the cops and robbers problem Benny Sudakov
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
• Induced Ramsey-type theorems Princeton University
• Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers,
• COMBINATORICA Bolyai Society Springer-Verlag
• http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 88 (2003) 329346
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
• Z .Journal of Algorithms 33, 173 184 1999 Article ID jagm.1999.1024, available online at http:rrwww.idealibrary.com on
• Information Processing Letters 67 (1998) 71--74 Coloring random graphs
• Combinatorics, Probability and Computing (2010) 19, 753774. c Cambridge University Press 2010 doi:10.1017/S0963548310000040
• * UCLA Colloquium * Date: Thursday, February 10, 3.00-3.50 in Room 6627
• * UCLA Combinatorics Seminar * Date: Thursday, May 20, 1.50-2.50 in Room 6229
• Combinatorics, Probability and Computing (2008) 17, 271286. c 2007 Cambridge University Press doi:10.1017/S0963548307008607 First published online 5 July 2007 Printed in the United Kingdom
• BENNY SUDAKOV CURRICULUM VITAE Affiliation
• Ramsey Numbers of Sparse Hypergraphs
• Algebraic Methods in Combinatorics Instructor: Benny Sudakov
• Journal of Combinatorial Theory, Series B 98 (2008) 10561062 www.elsevier.com/locate/jctb
• Concentration bounds for dependent randomized rounding in matroids
• The Chromatic Numbers of Random Hypergraphs
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• * UCLA Combinatorics Seminar * Date: Thursday, October 2, 1.50-2.50 in Room 6221
• Advances in Mathematics 227 (2011) 601609 www.elsevier.com/locate/aim
• A Generalization of Turan's Theorem
• The size Ramsey number of a directed path Ido Ben-Eliezer
• GAFA, Geom. funct. anal. Vol. 14 (2004) 913 940
• * UCLA Combinatorics Seminar * Date: Thursday, May 1, 1.50-2.50 in Room 6943
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics
• Combinatorics, Probability and Computing (2011) 20, 173211. c Cambridge University Press 2010 doi:10.1017/S0963548310000453
• Regular Induced Subgraphs of a Random Graph*
• Paths and stability number in digraphs Benny Sudakov
• BOLYAI SOCIETY Conference on Finite MATHEMATICAL STUDIES, X and Infinite Sets
• Nearly optimal embeddings of trees Benny Sudakov
• Approximate coloring of uniform hypergraphs \Lambda Michael Krivelevich y Benny Sudakov z
• * UCLA Combinatorics Seminar * Date: Thursday, May 13, 1.50-2.50 in Room 6229
• * UCLA Combinatorics Seminar * Date: Thursday, May 27, 1.50-2.50 in Room 6229
• Journal of Combinatorial Theory, Series B 97 (2007) 612619 www.elsevier.com/locate/jctb
• 1812 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 7, JULY 2003 ii) A [51; 41]2 code. The M part is 1B6, 193, 1CC, 187, 1F6, F7,
• Hamiltonicity, independence number, and pancyclicity Choongbum Lee
• Density theorems for bipartite graphs and related Ramsey-type results
• Combinatorics, Probability and Computing (2003) 12, 6172. c 2003 Cambridge University Press DOI: 10.1017/S0963548302005424 Printed in the United Kingdom
• On Smoothed Analysis in Dense Graphs and Formulas
• Large Kr-Free Subgraphs in Ks-Free Graphs and Some Other Ramsey-Type
• Recent developments in Extremal Combinatorics
• MATHEMATICS SECOND SERIES, VOL. 170, NO. 1
• Discrete Mathematics 191 (1998) 101--107 Note on alternating directed cycles
• * UCLA Combinatorics Seminar * Date: Thursday, May 5, 1.50-2.50 in Room 5217
• ON A QUESTION OF ERD OS AND MOSER B. SUDAKOV, E. SZEMEREDI, and V. H. VU
• A Ramsey-Type Result for the Hypercube
• Hamiltonicity Thresholds in Achlioptas Michael Krivelevich,1
• The Game Chromatic Number of Random Graphs
• Local Resilience of Graphs* Benny Sudakov,1,2
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
• A note on odd cycle-complete graph Ramsey numbers Benny Sudakov
• Disjoint Systems Noga Alon \Lambda
• ISRAEL JOURNAL OF MATHEMATICS 174 (2009), 285301 DOI: 10.1007/s11856-009-0115-9
• Introduction Perturb I Perturb II Beating random Conclusion Finding patterns that do not contain many
• Nonnegative k-sums, fractional covers, and probability of small Benny Sudakov
• Journal of Combinatorics Volume 2, Number 1, 83102, 2011
• On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
• Bandwidth theorem for random graphs Choongbum Lee
• An improved bound for the stepping-up lemma David Conlon
• Dependent Random Choice* Jacob Fox,1
• Ramsey Games With Giants* Tom Bohman,1
• AN APPROXIMATE VERSION OF SIDORENKO'S David Conlon, Jacob Fox and Benny Sudakov
• JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
• Proc. London Math. Soc. (3) 101 (2010) 655696 Ce2010 London Mathematical Society doi:10.1112/plms/pdp041
• COMBINATORICA Bolyai Society Springer-Verlag
• Author's personal copy Journal of Combinatorial Theory, Series B 100 (2010) 456467
• COMBINATORICA Bolyai Society Springer-Verlag
• GAFA, Geom. funct. anal. Vol. 19 (2009) 294 331
• European Journal of Combinatorics 30 (2009) 16301645 Contents lists available at ScienceDirect
• Journal of Combinatorial Theory, Series B 99 (2009) 494501 Contents lists available at ScienceDirect
• Avoiding Small Subgraphs in Achlioptas Michael Krivelevich,1,* Po-Shen Loh,2, Benny Sudakov3,
• Advances in Mathematics 219 (2008) 17711800 www.elsevier.com/locate/aim
• COMBINATORICA Bolyai Society Springer-Verlag
• Addenda: Cycle lengths in sparse graphs Benny Sudakov
• Journal of Combinatorial Theory, Series A 115 (2008) 15611569 Contents lists available at ScienceDirect
• How Many Random Edges Make a Dense Hypergraph Non-2-Colorable?*
• COMBINATORICA Bolyai Society Springer-Verlag
• On Graphs with Subgraphs Having Large
• Discrete Mathematics 307 (2007) 19611967 www.elsevier.com/locate/disc
• Erratum to Rainbow Turan Problems, by P. Keevash, D. Mubayi, B. Sudakov and J. Verstraete
• Combinatorics, Probability and Computing (2005) 14, 629647. c 2005 Cambridge University Press doi:10.1017/S0963548305007017 Printed in the United Kingdom
• SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 19, No. 3, pp. 719727
• Digital Object Identifier (DOI) 10.1007/s00220-003-0872-y Commun. Math. Phys. 239, 5363 (2003) Communications in
• Journal of Algorithms 49 (2003) 212 www.elsevier.com/locate/jalgor
• On the Probability of Independent Sets in Random Graphs
• Sparse Pseudo-Random Graphs are Hamiltonian
• Journal of Combinatorial Theory, Series A 99, 180190 (2002) doi:10.1006/jcta.2002.3264
• Acyclic Edge Colorings Noga Alon,1
• Random Regular Graphs of High Degree Michael Krivelevich,1
• Journal of Combinatorial Theory, Series B 77, 73 82 (1999) Coloring Graphs with Sparse Neighborhoods
• Finding a Large Hidden Clique in a Random Graph*
• Subgraphs with a Large Cochromatic Number
• Cycles and clique-minors in expanders Benny Sudakov
• Turan's theorem: variations and generalizations
• * UCLA Combinatorics Seminar * Date: Thursday, May 19, 1.50-2.50 in Room 5217
• AMS Special Session on Extremal and Probablistic Combinatorics Annandale-on-Hudson, NY
• Algebraic Methods in Combinatorics Instructor: Benny Sudakov
• Algebraic Methods in Combinatorics Instructor: Benny Sudakov
• * UCLA Colloquium * Date: Thursday, October 7, 3.00-3.50 in Room 6627
• * UCLA Combinatorics Seminar * Date: Thursday, April 29, 1.50-2.50 in Room 6229
• * UCLA Combinatorics Seminar * Date: Thursday, May 6, 1.50-2.50 in Room 6229
• Irredundant Families of Subcubes David Ellis
• * UCLA/IPAM Combinatorics Seminar * Date: Tuesday, September 29, 1.50-2.50 in Room 1200
• * UCLA/IPAM Combinatorics Seminar * Date: Thursday, October 1, 1.502.50 in Room 1200
• * UCLA/IPAM Combinatorics Colloquium * Date: Thursday, October 15, 3.004.00
• * UCLA/IPAM Combinatorics Seminar * Date: Thursday, October 29, 1.502.50 in IPAM Room 1200
• * UCLA/IPAM Combinatorics Seminar * Date: Thursday, November 19, 1.502.50 in IPAM Room 1200
• * UCLA Combinatorics Colloquium * Date: Thursday, April 9, 15.00-15.50 in Room 6627
• * UCLA Combinatorics Colloquium * Date: Thursday, February 12, 16.05-16.55 in Room 6627
• * UCLA Combinatorics Seminar * Date: December 4, TBA, 1.50-2.50 in Room 6221
• * UCLA Combinatorics Seminar * Date: Thursday, May 22, 1.50-2.50 in Room 6943
• Biased orientation games Ido Ben-Eliezer
• The size of a hypergraph and its matching number Po-Shen Loh
• Turan's Theorem: generalizations and applications
• Dirac's theorem for random graphs Choongbum Lee
• Bisections of graphs Choongbum Lee
• Self-similarity of graphs Choongbum Lee
• Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications
• Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
• Rainbow Turan Problem for Even Cycles Shagnik Das
• Robust Hamiltonicity of Dirac graphs Michael Krivelevich