List of Publications
Preprints

M. Bucic and B. Sudakov,
Large independent sets from local considerations, submitted.

R. Montgomery, A. Pokrovskiy and B. Sudakov,
A proof of Ringel's Conjecture, submitted.

P. Keevash, A. Pokrovskiy, B. Sudakov and L. Yepremyan,
New bounds for Ryser's conjecture and related problems, submitted.

D. Conlon, J. Fox, B. Sudakov and Y. Zhao,
The regularity method for graphs with few 4cycles, submitted.

N. Alon, M. Bucic and B. Sudakov,
Large cliques and independent sets all over the place, submitted.

R. Montgomery, A. Pokrovskiy and B. Sudakov,
$C_4$free subgraphs with large average degree, submitted.

C. Carlson, A. Kolla, R. Li, N. Mani, B. Sudakov and L. Trevisan,
Lower bounds for MaxCut in Hfree graphs via semidefinite programming, submitted.

S. Glock and B. Sudakov,
An average degree condition for independent transversals, submitted

M. Bucic, J. Fox and B. Sudakov,
Clique minors in graphs with a forbidden subgraph, submitted.

O. Cooley, N. Draganic, M. Kang and B. Sudakov,
Large induced matchings in random graphs, submitted.

J. Fox, M. Kwan and B. Sudakov,
Acyclic subgraphs of tournaments with high chromatic number, submitted.

M. Bucic, N. Draganic and B. Sudakov,
Universal and unavoidable graphs, submitted.

B. Sudakov, I. Tomon and A. Wagner,
Uniform chain decompositions and applications,
submitted.

M. Bucic, B. Sudakov and T. Tran,
ErdosSzekeres theorem for multidimensional arrays, submitted.

N. Kamcev, M. Krivelevich, N. Morrison and B. Sudakov,
The Konig Graph Process,
submitted.

M. Bucic, D. Korandi and B. Sudakov,
Covering graphs by monochromatic trees and Hellytype results for hypergraphs
,
submitted.
To appear

R. Montgomery, A. Pokrovskiy and B. Sudakov,
Embedding rainbow trees with applications to graph labelling and decomposition
,
J. European Math. Soc., to appear.

M. Bucic, M. Kwan, A. Pokrovskiy and B. Sudakov,
Halfway to Rota's basis conjecture
, Int. Math. Res. Not. (IMRN), to appear.
Companion note adapting our methods to the setting of a related conjecture due to Kahn.

M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran and A. Wagner,
Nearlylinear monotone paths in edgeordered graphs
, Israel Journal of Mathematics, to appear.

M. Bucic, E. Long, A. Shapira and B. Sudakov,
Tournament quasirandomness from local counting,
Combinatorica, to appear.

D. Conlon, J. Fox and B. Sudakov,
Short proofs of some extremal results III,
Random Structures and Algorithms, to appear.

A. Pokrovskiy and B. Sudakov,
Ramsey goodness of cycles, SIAM J. of Discrete Math., to appear.

R. Nenadov, B. Sudakov and M. Tyomkyn,
Proof of the BrownErdosSos conjecture in groups,
Math. Proc. Cambridge Philos. Soc., to appear.

I. Balla, S. Letzter and B. Sudakov,
Orthonormal representations of Hfree graphs,
Discrete and Computational Geometry, to appear.
2020

M. Kwan and B. Sudakov,
Ramsey graphs induce subgraphs of quadratically many sizes
, Int. Math. Res. Not. (IMRN) 2020 (2020), 16211638.

B. Sudakov and I. Tomon,
Turan number of bipartite graphs with no K_{t,t},
Proceedings of AMS 148 (2020), 28112818.

M. Bucic, E. Jahn, A. Pokrovskiy and B. Sudakov,
2factors with k cycles in Hamiltonian graphs,
J. Combinatorial Theory Ser. B 144 (2020), 150166.

A. Ferber, V. Jain and B. Sudakov,
Number of 1factorizations of regular highdegree graphs
, Combinatorica 40 (2020), 315344.

M. Krivelevich, E. Lubetzky and B. Sudakov,
Asymptotics in percolation on highgirth expanders
, Random Structures and Algorithms 56 (2020), 927947.

S. Letzter and B. Sudakov,
The oriented size Ramsey number of directed paths
, European Journal of Combinatorics 88 (2020), Article 103103.

R. Nenadov, B. Sudakov and A. Wagner
Completion and deficiency problems,
J. Combinatorial Theory Ser. B 145 (2020), 214240.

M. Kwan, S. Letzter, B. Sudakov and T. Tran,
Dense induced bipartite subgraphs in trianglefree graphs,
Combinatorica 40 (2020), 283305.

R. Nenadov, M. Sawhney, B. Sudakov and A. Wagner
Bounded degree Spanners of the hypercube,
The Electronic J. of Combinatorics 27 (2020), #P3.3

Frederik Benzing, A. Pokrovskiy and B. Sudakov,
Long directed rainbow cycles and rainbow spanning trees
, European Journal of Combinatorics 88 (2020), Article 103102.

M. Bucic, S. Heberle, S. Letzter and B. Sudakov,
Monochromatic trees in random tournaments,
Combinatorics, Probability and Computing 29 (2020), 318345.

D. Conlon, J. Fox and B. Sudakov,
Books versus triangles at the extremal density,
SIAM J. of Discrete Math. 34 (2020), 385398.

O. Angel, A.Ferber, B. Sudakov and V. Tassion,
Long monotone trails in random edgelabelings of random graphs
, Combinatorics, Probability and Computing 29 (2020), 2230.

S. Konyagin and B. Sudakov,
An extremal problem for integer sparse recovery,
Linear Algebra and its Application 586 (2020), 16.
2019

M. Kwan and B. Sudakov,
Proof of a conjecture on induced subgraphs of Ramsey graphs
, Transactions Amer. Math. Soc. 372 (2019), 55715594.

R. Montgomery, A. Pokrovskiy and B. Sudakov,
Decompositions into spanning rainbow structures
, Proc. London Math. Soc. 119 (2019), 899959.

D. Conlon, J. Fox and B. Sudakov,
Towertype bounds for unavoidable patterns in words,
Transactions Amer. Math. Soc. 372 (2019), 62136229.

M. Kwan, B. Sudakov and T. Tran,
Anticoncentration for subgraph statistics
, J. London Mathematical Society 99 (2019) 757777.

D. Conlon, J. Fox, M. Kwan and B. Sudakov,
Hypergraph cuts above the average
, Israel Journal of Mathematics 233 (2019), 67111.

M. Nagele, B. Sudakov and R. Zenklusen,
Submodular Minimization Under Congruency Constraints
, Combinatorica 39 (2019), 13511386.
A preliminary version appeared in:
Proc. of the 29th Annual ACMSIAM SODA, ACM Press (2018), 849866.

A. Pokrovskiy and B. Sudakov,
A counterexample to Stein's Equinsquare Conjecture
, Proceedings of AMS 147 (2019), 22812287.

M. Bucic, S. Letzter and B. Sudakov,
Directed Ramsey number for trees,
J. Combinatorial Theory Ser. B 137 (2019), 145177.

I. Balla and B. Sudakov,
Equiangular subspaces in Euclidean spaces,
Discrete and Computational Geometry 61 (2019), 8190.

M. Bucic, S. Letzter and B. Sudakov,
Three colour bipartite Ramsey number of cycles and paths
,
J. Graph Theory 92 (2019), 445459.

S. Das, R. Glebov, B. Sudakov and T. Tran,
Colouring set families without monochromatic kchains
, J. Combinatorial Theory Ser. A 168 (2019), 84119.

M. Bucic, S. Letzter and B. Sudakov,
Monochromatic paths in random tournaments,
Random Structures and Algorithms 54 (2019), 6981.

T. Kalinowski, N. Kamcev and B. Sudakov,
Zero forcing number of graphs, SIAM J. of Discrete Math. 33 (2019), 95115.

M. Bucic, S. Letzter and B. Sudakov,
Multicolour bipartite Ramsey number of paths,
The Electronic J. of Combinatorics 26 (2019), P3.60.

L. Fukshansky, D. Needell and B. Sudakov,
An algebraic perspective on integer sparse recovery
, Applied Mathematics and Computation 340 (2019), 3142.
2018

I. Balla, F. Draxler, P. Keevash and B. Sudakov,
Equiangular Lines and Spherical Codes in Euclidean Space,
Inventiones math. 211 (2018), 179212.

A. Ferber, E. Long and B. Sudakov,
Counting Hamilton decompositions of oriented graphs,
Int. Math. Res. Not. (IMRN) 2018 (2018), 69086933.

M. Bucic, S. Letzter, B. Sudakov and T. Tran,
Minimum saturated families of sets
, Bull. London Math. Soc. 50 (2018), 725732.

P. Loh, M. Krivelevich, M. Kwan and B. Sudakov,
The random kmatchingfree process,
Random Structures and Algorithms 53 (2018), 692716.

A. Ferber, M. Kwan and B. Sudakov,
Counting Hamilton cycles in sparse random directed graphs,
Random Structures and Algorithms 53 (2018), 592603.

N. Kamcev, T. Luczak and B. Sudakov,
Anogramfree colorings , Combinatorics, Probability and Computing 27 (2018), 623642.

A. Pokrovskiy and B. Sudakov,
Linearly many rainbow trees in properly edgecoloured complete graphs,
J. Combinatorial Theory Ser. B 132 (2018) 134156.

D. Conlon, J. Fox and B. Sudakov,
Hereditary quasirandomness without regularity,
Math. Proc. Cambridge Philos. Soc. 164 (2018), 385399.

D. Korandi, F. Mousset, R. Nenadov, N. Skoric, B. Sudakov,
Monochromatic cycle covers in random graphs
,
Random Structures and Algorithms 53 (2018), 667691.

J. Briggs, A. Frieze, M. Krivelevich, P. Loh and B. Sudakov,
Packing Hamilton Cycles Online,
Combinatorics, Probability and Computing 27 (2018), 475495.

M. Kwan, B. Sudakov and P. Vieira,
Nontrivially intersecting multipart families,
J. Combinatorial Theory Ser. A 156 (2018), 4460.

M. Kwan and B. Sudakov,
Intercalates and Discrepancy in Random Latin Squares
, Random Structures and Algorithms 52 (2018), 181196.

I. Balla, A. Pokrovskiy and B. Sudakov,
Ramsey goodness of bounded degree trees,
Combinatorics, Probability and Computing 27 (2018), 289309.

B. Sudakov and P. Vieira,
Two remarks on even and oddtown problems,
SIAM J. of Discrete Math. 32 (2018), 280295.

J. Noel, A. Scott and B. Sudakov,
Supersaturation in Posets and Applications Involving the Container Method,
J. Combinatorial Theory Ser. A 154 (2018), 247284.
2017

N. Alon, A. Pokrovskiy and B. Sudakov,
Random subgraphs of properly edgecoloured complete graphs and long rainbow cycles,
Israel Journal of Mathematics 222 (2017), 317331.

R. Gelbov, Z. Luria and B. Sudakov,
The number of Hamiltonian decompositions of regular graphs,
Israel Journal of Mathematics 222 (2017), 91108.

I. Balla, A. Pokrovskiy and B. Sudakov
A remark on Hamilton cycles
with few colors,
Moscow J. Combinatorics and Number Theory 7 (2017), 259263.

N. Alon, K. Efremenko and B. Sudakov,
Testing Equality in Communication Graphs,
IEEE Transactions on Information Theory 63 (2017), 75697574.

M. Krivelevich, C. Lee and B. Sudakov,
Compatible Hamilton cycles in Dirac graphs, Combinatorica 37 (2017), 697732.

B. Sudakov,
Robustness of graph properties,
in: Surveys in Combinatorics 2017, Cambridge University Press, 2017, 372408.

A. Kostochka, B. Sudakov and J. Verstraete,
Cycles in trianglefree graphs of large chromatic number
, Combinatorica 37 (2017), 481494.

D. Korandi and B. Sudakov,
Saturation in random graphs, Random Structures and Algorithms 51 (2017), 169181.

N. Kamcev, B. Sudakov and J. Volec,
Bounded colourings of multipartite graphs and hypergraphs,
European Journal of Combinatorics 66 (2017), 235249.

J. Fox, H. Huang and B. Sudakov,
On graphs decomposable into induced matchings of linear sizes,
Bull. London Math. Soc. 49 (2017), 4557.

M. Krivelevich, M. Kwan and B. Sudakov,
Boundeddegree spanning trees in randomly perturbed graphs
, SIAM J. of Discrete Math. 31 (2017), 155171.

R. Glebov, H. Naves and B. Sudakov,
The threshold probability for long cycles,
Combinatorics, Probability and Computing 26 (2017), 208247.

B. Sudakov and J. Verstraete,
The Extremal Function for Cycles of length l mod k
, The Electronic J. of Combinatorics 24 (2017), P1.7.

A. Pokrovskiy and B. Sudakov,
Ramsey goodness of paths, J. Combinatorial Theory Ser. B 122 (2017), 384390.

B. Sudakov and J. Volec,
Properly colored and rainbow copies of graphs with few cherries,
J. Combinatorial Theory Ser. B 122 (2017), 391416.

A. Ferber, M. Krivelevich, B. Sudakov and P. Vieira,
Finding paths in sparse random graphs requires many queries, Random Structures and Algorithms 50 (2017), 7185.

D. Korandi and B. Sudakov,
Domination in 3tournaments, J. Combinatorial Theory Ser. A 146 (2017), 165168.

E. Shamir and B. Sudakov,
TwoSided, Unbiased Version of Hall's Marriage Theorem
, American Math. Monthly 124 (2017), 7980.

A. Ferber, M. Krivelevich and B. Sudakov,
Counting and packing Hamilton cycles in dense graphs and oriented graphs,
J. Combinatorial Theory Ser. B 122 (2017), 196220.

D. Conlon, J. Fox, C. Lee and B. Sudakov,
Ordered Ramsey numbers, J. Combinatorial Theory Ser. B 122 (2017), 353383.
2016

S. Das, W. Gan and B. Sudakov,
The minimum number of disjoint pairs in set
systems and related problems,
Combinatorica 36 (2016), 623660.

H. Huang, N. Linial, H. Naves, Y. Peled and B. Sudakov,
On the densities of cliques and independent sets in graphs, Combinatorica 36 (2016), 493512.

A. Ferber, M. Krivelevich, B. Sudakov and P. Vieira,
Finding Hamilton cycles in random graphs with few queries, Random Structures and Algorithms
49 (2016), 635668.

D. Conlon, J. Fox and B. Sudakov,
Short proofs of some extremal results II,
J. Combinatorial Theory Ser. B 121 (2016), 173196.

M. Krivelevich, M. Kwan and B. Sudakov,
Cycles and matchings in randomly perturbed digraphs and hypergraphs,
Combinatorics, Probability and Computing 25 (2016), 909927.

N. Kamcev, M. Krivelevich and B. Sudakov,
Some Remarks on Rainbow Connectivity, J. Graph Theory 83 (2016), 372383.

M. Krivelevich, C. Lee and B. Sudakov,
Compatible Hamilton cycles in random graphs, Random Structures and Algorithms 49 (2016), 533557.

D. Hefetz, A. Steger and B. Sudakov,
Random directed graphs are robustly Hamiltonian,
Random Structures and Algorithms 49 (2016), 345362.
A full version of this paper
arxiv.

N. Alon, H. Naves and B. Sudakov
On the maximum quartet distance between phylogenetic trees,
SIAM J. of Discrete Math. 30 (2016), 718735.
A preliminary version appeared in:
Proc. of the 27th Annual ACMSIAM SODA, ACM Press (2016), 20952106.

W. Samotij and B. Sudakov,
The number of additive triples in subsets of abelian groups,
Math. Proc. Cambridge Philos. Soc. 160 (2016), 495512.

D. Conlon, J. Fox, C. Lee and B. Sudakov,
Ramsey numbers of cubes versus cliques, Combinatorica 36 (2016), 3770.

D. Korandi, Y. Peled and B. Sudakov,
A random triadic process, SIAM J. of Discrete Math. 30 (2016), 119.

C. Lee, P. Loh and B. Sudakov,
Judicious partitions of directed graphs,
Random Structures and Algorithms 48 (2016), 147170.

S. Das, B. Sudakov and P. Vieira,
AlmostFisher families, J. Combinatorial Theory Ser. A 138 (2016), 175207.

A. Ferber, M. Krivelevich and B. Sudakov,
Counting and packing Hamilton lcycles in dense hypergraphs,
Journal of Combinatorics 7 (2016), 135157.
2015

D. Korandi, M. Krivelevich and B. Sudakov,
Decomposing random graphs into few cycles and edges,
Combinatorics, Probability and Computing 24 (2015), 857872.

D. Conlon, J. Fox, C. Lee and B. Sudakov,
On the grid Ramsey problem and related questions
, Int. Math. Res. Not. (IMRN) 2015 (2015), 80528084.

D. Conlon, J. Fox and B. Sudakov,
Recent developments in graph Ramsey theory,
in: Surveys in Combinatorics 2015, Cambridge University Press,
2015, 49118.

N. Alon, S. Das, R. Glebov and B. Sudakov,
Comparable pairs in families of sets, J. Combinatorial Theory Ser. B 115 (2015), 164185.

W. Samotij and B. Sudakov,
On the number of monotone sequences, J. Combinatorial Theory Ser. B 115 (2015), 132163.

J. Ma, H. Naves and B. Sudakov,
Discrepancy of random graphs and hypergraphs,
Random Structures and Algorithms 47 (2015), 147162.

S. Das, W. Gan and B. Sudakov,
Sperner's Theorem and a Problem of Erdos, Katona and Kleitman,
Combinatorics, Probability and Computing 24 (2015), 585608.

A. Shapira and B. Sudakov,
Small Complete Minors Above the Extremal Edge Density,
Combinatorica 35 (2015), 7594.

W. Gan, P. Loh and B. Sudakov,
Maximizing the number of independent sets of a fixed
size, Combinatorics, Probability and Computing 24 (2015), 521527.

S. Das and B. Sudakov,
Most probably intersecting hypergraphs,
The Electronic J. of Combinatorics 22(1) (2015), P1.80.

J. von Brecht, B. Sudakov and A. Bertozzi,
Swarming on random graphs II, Journal of Statistical Physics 158 (2015), 699734.

D. Conlon, J. Fox, C. Lee and B. Sudakov,
The ErdosGyarfas problem on generalized Ramsey numbers,
Proc. London Math. Soc. 110 (2015), 118.

M. Krivelevich, C. Lee and B. Sudakov,
Long paths and cycles in random subgraphs of graphs with large minimum degree,
Random Structures and Algorithms 46 (2015), 320345.

W. Gan, D. Korandi and B. Sudakov,
K_{s,t}saturated bipartite graphs, European Journal of Combinatorics
45 (2015), 1220.
2014

D. Conlon, J. Fox and B. Sudakov,
Cycle packing, Random Structures and Algorithms 45 (2014), 608626.

M. Krivelevich, E. Lubetzky and B. Sudakov,
Cores of random graphs are born Hamiltonian,
Proc. London Math. Soc. 109 (2014), 161188.

H. Huang and B. Sudakov,
The minimum number of nonnegative edges in hypergraphs ,
The Electronic J. of Combinatorics 21(3) (2014), P3.7.

Y. Afek, Y. Babichenko, U. Feige, E. Gafni, N. Linial
and B. Sudakov,
Musical chairs
, SIAM J. of Discrete Math. 28 (2014), 15781600.
A distributed computing version appeared as:
Oblivious Collaboration,
Proc. of the 25th Symposium on Distributed Computing (DISC'11), LNCS volume 6950, 2011,
489504.

D. Conlon, J. Fox, J. Pach, B. Sudakov and A. Suk,
Ramseytype results for semialgebraic relations,
Transactions Amer. Math. Soc. 366 (2014), 50435065 .

M. Krivelevich, C. Lee and B. Sudakov,
Robust Hamiltonicity of Dirac graphs,
Transactions Amer. Math. Soc. 366 (2014), 30953130.

H. Huang, N. Linial, H. Naves, Y. Peled and B. Sudakov,
On the 3local profiles of graphs,
J. Graph Theory 76 (2014), 236248.

A. Ferber, R. Hod, M. Krivelevich and B. Sudakov,
A construction of almost Steiner systems,
J. Combinatorial Designs 22 (2014), 488494.

P. Allen, P. Keevash, B. Sudakov and J. Verstraete,
Turan numbers of bipartite graphs plus an odd cycle,
J. Combinatorial Theory Ser. B 106 (2014), 134162.

R. Glebov, B. Sudakov and T. Szabo,
How many colors guarantee a rainbow matching?,
The Electronic J. of Combinatorics 21(1) (2014), P1.27.

D. Conlon, J. Fox and B. Sudakov,
Short proofs of some extremal results,
Combinatorics, Probability and Computing 23 (2014), 828.
2013

D. Conlon, J. Fox and B. Sudakov,
Two extensions of Ramsey's theorem,
Duke Mathematical Journal 162 (2013), 29032927.

N. Alon A. Moitra and B. Sudakov,
Nearly Complete Graphs Decomposable into
Large Induced Matchings and their Applications,
J. European Math. Soc. 15 (2013), 15751596.
A preliminary version appeared in:
Proc. of the 44th ACM STOC (2012), 10791090

Y. Peres, D. Sotnikov, B. Sudakov and U. Zwick,
AllPairs shortest paths in O(n^2) time with high probability,
Journal of the ACM 60 (2013), Article 26.
A preliminary version appeared in:
Proc. of the 51st IEEE FOCS (2010), 663672.

N. Parrish, B. Sudakov and E. Eskin,
Genome reassembly with highthroughput sequencing data,
BMC Genomics 14 (2013), (Suppl 1):S8.
A preliminary version appeared in: 11th Asia Pacific Bioinformatics Conference (APBC 2013): Genomics.

P. Keevash, B. Sudakov and J. Verstraete,
On a conjecture of Erdos and Simonovits: Even cycles, Combinatorica 33 (2013), 699732.

C. Lee, P. Loh and B. Sudakov,
Bisections of graphs, J. Combinatorial Theory Ser. B 103 (2013), 599629.

H. Huang, J. Ma, A. Shapira, B. Sudakov and R. Yuster,
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
, Combinatorics, Probability and Computing 22 (2013), 859873.

M. Krivelevich and B. Sudakov,
The phase transition in random graphs  a simple proof,
Random Structures and Algorithms 43 (2013), 131138.

J. Fox, C. Lee, and B. Sudakov,
Chromatic number, clique subdivisions, and the conjectures of Hajos and
ErdosFajtlowicz, Combinatorica 33 (2013), 181197.

M. Krivelevich, E. Lubetzky and B. Sudakov,
Longest cycles in sparse random digraphs,
Random Structures and Algorithms 43 (2013), 115.

C. Lee, P. Loh and B. Sudakov,
Selfsimilarity of graphs, SIAM J. of Discrete Math. 27 (2013), 959972.

S. Das, H. Huang, J. Ma, H. Naves and B. Sudakov,
A problem of Erdos on the minimum number of kcliques,
J. Combinatorial Theory Ser. B 103 (2013) 344373.

D. Conlon, J. Fox and B. Sudakov,
An improved bound for the steppingup lemma ,
Discrete Applied Mathematics 161 (2013) 11911196.

S. Das, C. Lee and B. Sudakov,
Rainbow Turan Problem for Even Cycles,
European Journal of Combinatorics 34 (2013), 905915.
2012

J. Fox, J. Pach, B. Sudakov and A. Suk,
ErdosSzekerestype theorems for monotone paths and convex bodies,
Proc. London Math. Soc. 105 (2012), 953982.
Erratum to this paper.

D. Conlon, J. Fox and B. Sudakov,
On two problems in graph Ramsey theory, Combinatorica 32 (2012), 513535.

J. Fox, C. Lee and B. Sudakov,
Maximum unionfree subfamilies,
Israel Journal of Mathematics 191 (2012), 959971.

C. Lee and B. Sudakov,
Dirac's theorem for random graphs,
Random Structures and Algorithms 41 (2012), 293305.

D. Conlon, J. Fox and B. Sudakov,
ErdosHajnaltype theorems in hypergraphs,
J. Combinatorial Theory Ser. B 102 (2012), 11421154.

H. Huang and B. Sudakov,
A counterexample to the AlonSaksSeymour conjecture and related problems,
Combinatorica 32 (2012), 205219.

C. Lee, B. Sudakov and D. Vilenchik,
Getting directed Hamilton cycle twice faster
, Combinatorics, Probability and Computing 21 (2012), 773801.

I. BenEliezer, M. Krivelevich and B. Sudakov,
Long cycles in subgraphs of (pseudo)random directed graphs,
J. Graph Theory 70 (2012), 284296.

H. Huang, P. Loh and B. Sudakov,
The size of a hypergraph and its matching number,
Combinatorics, Probability and Computing 21 (2012), 442450.

I. BenEliezer, M. Krivelevich and B. Sudakov,
Biased orientation games,
Discrete Mathematics 312 (2012), 17321742.

N. Alon, P. Frankl, H. Huang, V. Rodl, A. Rucinski and B. Sudakov,
Large matchings in uniform hypergraphs
and the conjectures of Erdos and Samuels,
J. Combinatorial Theory Ser. A 119 (2012), 12001215.

N. Alon, H. Huang and B. Sudakov,
Nonnegative ksums,
fractional covers, and probability of small deviations
, J. Combinatorial Theory Ser. B 102 (2012), 784796.

I. BenEliezer, M. Krivelevich and B. Sudakov,
The size Ramsey number of a directed path,
J. Combinatorial Theory Ser. B 102 (2012), 743755.

C. Lee and B. Sudakov,
Hamiltonicity, independence number, and pancyclicity,
European Journal of Combinatorics 33 (2012), 449457.

H. Huang, C. Lee and B. Sudakov,
Bandwidth theorem for random graphs,
J. Combinatorial Theory Ser. B 102 (2012), 1437.
2011

E. Lubetzky, B. Sudakov and V. Vu,
Spectra of lifted Ramanujan graphs, Advances in Mathematics
227 (2011), 16121645.

B. Sudakov,
A conjecture of Erdos on graph Ramsey numbers,
Advances in Mathematics 227 (2011), 601609.

A. Scott and B. Sudakov,
A bound for the cops and robbers problem,
SIAM J. of Discrete Math 25 (2011), 14381442.

D. Ellis and B. Sudakov,
Generating all subsets of a finite set with disjoint
unions, J. Combinatorial Theory Ser. A 118 (2011), 23192345.

M. Krivelevich, B. Sudakov, N. Wormald
Regular induced subgraphs of a random graph
, Random Structures and Algorithms 38 (2011), 235250.

D. Conlon, J. Fox and B. Sudakov,
Large almost monochromatic subsets in hypergraphs,
Israel Journal of Mathematics 181 (2011), 423432.

S. BenShimon, M. Krivelevich and B. Sudakov,
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs,
SIAM J. of Discrete Math 25 (2011), 11761193.

B. Sudakov and J. Verstraete,
Cycles in graphs with large independence ratio,
Journal of Combinatorics 2 (2011), 82102.

J. Fox and B. Sudakov,
Dependent Random Choice,
Random Structures and Algorithms 38 (2011), 132.

S. BenShimon, M. Krivelevich and B. Sudakov,
Local resilience and Hamiltonicity MakerBreaker games in random regular graph,
Combinatorics, Probability and Computing 20 (2011), 173211.

T. Bohman, A. Frieze, M. Krivelevich, P. Loh and B. Sudakov,
Ramsey games with giants,
Random Structures and Algorithms 38 (2011), 6899.
2010

D. Conlon, J. Fox and B. Sudakov,
An approximate version of Sidorenko's conjecture,
Geometric and Functional Analysis 20 (2010), 13541366.
Short, selfcontained exposition.

B. Sudakov,
Recent developments in extremal combinatorics:
Ramsey and Turan type problems,
Proc. International Congress of Mathematicians,
Hyderabad, India, 2010, Vol 4, 25792606.

D. Conlon, J. Fox and B. Sudakov,
Hypergraph Ramsey numbers,
J. Amer. Math. Soc. 23 (2010), 247266.

P. Loh, O. Pikhurko and B. Sudakov,
Maximizing the number of qcolorings,
Proc. London Math. Soc. 101 (2010), 655696.

N. Alon and B. Sudakov,
Increasing the chromatic number of a random graph,
Journal of Combinatorics 1 (2010), 345356.

B. Barak, G. Kindler, R. Shaltiel, B. Sudakov and A. Wigderson,
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors ,
Journal of the ACM 57 (2010), Article No. 20.
A
preliminary version appeared in:
Proc. of the 37th ACM STOC (2005), 110.

B. Sudakov and J. Vondrak,
A randomized embedding algorithm for trees,
Combinatorica 30 (2010), 445470.

M. Krivelevich, E. Lubetzky and B. Sudakov,
Hamiltonicity thresholds in Achlioptas processes,
Random Structures and Algorithms 37 (2010), 124.

J. Fox and B. Sudakov,
Decompositions into subgraphs of small diameter,
Combinatorics, Probability and Computing 19 (2010), 753774.

P. Keevash and B. Sudakov,
Pancyclicity of Hamiltonian and highly connected graphs,
J. Combinatorial Theory Ser. B 100 (2010), 456467.

M. Krivelevich, C. Lee and B. Sudakov,
Resilient pancyclicity of random and pseudorandom graphs,
SIAM J. of Discrete Math. 24 (2010), 116.

J. Fox, P. Keevash and B. Sudakov,
Directed graphs without short cycles,
Combinatorics, Probability and Computing 19 (2010), 285301.
2009

N. Alon, A. Shapira and B. Sudakov,
Additive approximation for edgedeletion problems,
Annals of Mathematics 170 (2009), 371411.
A preliminary version appeared in:
Proc. of the 46th IEEE FOCS (2005), 419428.

J. Fox and B. Sudakov,
Density theorems for bipartite graphs and related Ramseytype results,
Combinatorica 29 (2009), 153196.

M. Krivelevich and B. Sudakov,
Minors in expanding graphs,
Geometric and Functional Analysis 19 (2009), 294331.

N. Alon, B. Bukh and B. Sudakov,
Discrete Kakeyatype problems and small bases,
Israel Journal of Mathematics 174 (2009), 285301 .

J. Fox and B. Sudakov,
Two remarks on the BurrErdos conjecture
, European J. Combinatorics 30 (2009), 16301645.

M. Krivelevich, B. Sudakov and D. Vilenchik,
On the random satisfiable process,
Combinatorics, Probability and Computing 18 (2009), 775801.

D. Conlon, J. Fox and B. Sudakov,
Ramsey numbers of sparse hypergraphs,
Random Structures and Algorithms 35 (2009), 114.

P. Keevash and B. Sudakov,
Triangle packings and 1factors in oriented graphs
, J. Combinatorial Theory Ser. B 99 (2009), 709727.

J. Fox and B. Sudakov,
Paths and stability number in digraphs,
The Electronic J. of Combinatorics 16(1) (2009), N23.

P. Loh and B. Sudakov,
Constrained Ramsey Numbers,
Combinatorics, Probability and Computing 18 (2009), 247258.

J. Fox, P. Loh and B. Sudakov,
Large induced trees in K_rfree graphs,
J. Combinatorial Theory Ser. B 99 (2009), 494501.

M. Krivelevich, P. Loh and B. Sudakov,
Avoiding small subgraphs in Achlioptas processes
, Random Structures and Algorithms 34 (2009), 165195.
A full version of this paper appeared on
arxiv.
2008

J. Fox and B. Sudakov,
Induced Ramseytype theorems,
Advances in Mathematics 219 (2008), 17711800.

B. Sudakov and V. Vu,
Local resilience of graphs,
Random Structures and Algorithms 33 (2008), 409433.

J. Fox and B. Sudakov,
Ramseytype problem for an almost monochromatic K_4
, SIAM J. of Discrete Math. 23 (2008), 155162.

B. Sudakov and J. Verstraete,
Cycle lengths in sparse graphs, Combinatorica 28 (2008), 357372.
Erratum to this paper.

J. Fox and B. Sudakov,
Unavoidable patterns,
J. Combinatorial Theory Ser. A 115 (2008), 15611569.

B. Sudakov and J. Vondrak,
How many random edges make a dense hypergraph
non2colorable?, Random Structures and Algorithms 32 (2008), 290306.

N. Alon, M. Krivelevich and B. Sudakov,
Large nearly regular induced subgraphs,
SIAM J. of Discrete Math. 22 (2008), 13251337.

J. Fox and B. Sudakov,
On a problem of DukeErdosRodl on
cycleconnected subgraphs,
J. Combinatorial Theory Ser. B 98 (2008), 10561062.

P. Loh and B. Sudakov,
On the strong chromatic number of random graphs,
Combinatorics, Probability and Computing 17 (2008), 271286.

T. Bohman, A. Frieze and B. Sudakov,
The game chromatic number of random graphs,
Random Structures and Algorithms 32 (2008), 223235.
2007

N. Alon, M. Krivelevich and B. Sudakov,
Embedding nearlyspanning bounded degree trees, Combinatorica 27
(2007), 629644.

B. Sudakov,
Ramsey numbers and the size of graphs,
SIAM J. of Discrete Math. 21 (2007), 980986.

B. Sudakov,
Making a K_4free graph bipartite,
Combinatorica 27 (2007), 509518.

P. Loh and B. Sudakov,
Independent transversals in locally sparse graphs,
J. Combinatorial Theory Ser. B 97 (2007), 904918.

N. Alon and B. Sudakov,
On graphs with subgraphs having large independence numbers,
J. Graph Theory 56 (2007), 149157.

B. Bukh and B. Sudakov,
Induced subgraphs of Ramsey graphs with many distinct degrees,
J. Combinatorial Theory Ser. B 97 (2007), 612619.

J.H. Kim, B. Sudakov and V. Vu,
Small subgraphs of random regular graphs,
Discrete Mathematics 307 (2007), 19611967.

P. Keevash, D. Mubayi, B. Sudakov and J. Verstraete,
Rainbow Turan Problems,
Combinatorics, Probability and Computing 16 (2007), 109126.
Erratum to this paper.
2006

E. Mossel, R. O'Donnell, O. Regev, J. Steif and B. Sudakov,
NonInteractive Correlation Distillation, Inhomogeneous Markov Chains
and the Reverse BonamiBeckner Inequality,
Israel Journal of Mathematics 154 (2006), 299336.

J. Balogh, P. Keevash and B. Sudakov,
On the minimal degree implying equality of the
largest trianglefree and bipartite subgraphs,
J. Combinatorial Theory Ser. B 96 (2006), 919932.

N. Alon, R. Radoicic, B. Sudakov and J. Vondrak,
A Ramseytype result for the hypercube,
J. Graph Theory 53 (2006), 196208.

P. Keevash and B. Sudakov,
On a restricted crossintersection problem
, J. Combinatorial Theory Ser. A 113 (2006), 15361542.

M. Krivelevich, B. Sudakov and P. Tetali,
On smoothed analysis in dense graphs and formulas,
Random Structures and Algorithms 29 (2006), 180193.

M. Krivelevich and B. Sudakov,
Pseudorandom
graphs, in: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15,
Springer, 2006, 199262.

P. Keevash, P. Loh and B. Sudakov,
Bounding the number of edges in permutation graphs,
The Electronic J. of Combinatorics 13 (2006), R44.

P. Keevash and B. Sudakov,
Sparse halves in trianglefree graphs,
J. Combinatorial Theory Ser. B 96 (2006), 614620.

N. Alon and B. Sudakov,
Hfree graphs of large minimum degree,
The Electronic J. of Combinatorics 13 (2006), R19.
2005

B. Sudakov, E. Szemeredi and V. Vu,
On a question of Erdos and Moser,
Duke Mathematical Journal 129 (2005), 129155.

P. Keevash and B. Sudakov,
On a hypergraph Turan problem of Frankl, Combinatorica 25 (2005), 673706.

N. Alon, M. Krivelevich and B. Sudakov,
MaxCut in Hfree graphs,
Combinatorics, Probability and Computing 14 (2005), 629647.

B. Sudakov,
A
new lower bound for a Ramseytype problem,
Combinatorica 25 (2005), 487498.

A. Frieze, M. Krivelevich and B. Sudakov,
The strong chromatic index of random graphs,
SIAM J. of Discrete Math. 19 (2005), 719727.

P. Keevash and B. Sudakov,
The exact Turan number of the Fano plane, Combinatorica
25 (2005), 561574.

J. Balogh, P. Keevash and B. Sudakov,
Disjoint representability of sets and their complements,
J. Combinatorial Theory Ser. B 95 (2005), 1228.

B. Sudakov, T. Szabo and V. Vu,
A generalization of Turan's theorem,
J. Graph Theory 49 (2005), 187195.

P. Keevash and B. Sudakov,
Set systems with restricted crossintersections
and the minimum rank of inclusion matrices, SIAM J. of Discrete Math.
18 (2005), 713727.

B. Reed and B. Sudakov,
List
coloring when the chromatic number is close to the order of the graph,
Combinatorica 25 (2005), 117123.

B. Sudakov,
Large K_rfree subgraphs in K_sfree graphs and some other
Ramseytype problems, Random Structures and Algorithms 26 (2005), 253265.
2004

N. Alon, I. Dinur, E. Friedgut and B. Sudakov,
Graph products, fourier analysis and spectral techniques,
Geometric and Functional Analysis 14 (2004), 913940.

N. Alon, J. Balogh, P. Keevash and B. Sudakov,
The
number of edge colorings with no monochromatic cliques,
J. London Mathematical Society 70 (2004), 273288.

B. Bollobas, P. Keevash and B. Sudakov,
Multicoloured extremal problems, J. Combinatorial Theory Ser. A
107 (2004), 295312.

P. Keevash and B. Sudakov,
Packing
triangles in a graph and its complement, J. Graph Theory 47 (2004),
203216.
A magma program implementing an algorithm used in this paper can be
downloaded here.

M. Krivelevich, B. Sudakov and T.Szabo,
Triangle
factors in pseudorandom graphs,
Combinatorica 24 (2004), 403426.

N. Alon, R. Beigel, S. Kasif, S. Rudich and B. Sudakov,
Learning
a hidden matching, SIAM J. on Computing 33 (2004), 487501.
A preliminary version appeared in:
Proc. of the 43rd IEEE FOCS (2002), 197206.

B. Bollobas, D. Gamarnik, O. Riordan and B. Sudakov,
On
the value of a random minimum length Steiner tree,
Combinatorica 24 (2004), 187207.

P. Keevash, M. Saks, B. Sudakov and J. Verstraete,
Multicolour Turan problems, Advances in Applied Mathematics 33 (2004), 238262.

Z. Furedi and B. Sudakov,
Extremal setsystems with restricted kwise intersections,
J. Combinatorial Theory Ser. A 105 (2004), 143159.

P. Keevash and B. Sudakov,
On
the number of edges not covered by monochromatic copies of a fixed graph,
J. Combinatorial Theory Ser. B 90 (2004), 4153.
2003

A. Kostochka and B. Sudakov,
On
Ramsey numbers of sparse graphs
, Combinatorics, Probability
and Computing 12 (2003), 627641.

N. Alon, M. Krivelevich and B. Sudakov,
Turan numbers of bipartite graphs and related Ramseytype questions
, Combinatorics, Probability and Computing 12 (2003), 477494.

A. Soshnikov and B. Sudakov,
On the largest eigenvalue of a random subgraph of the hypercube,
Communications in Mathematical Physics 239 (2003), 5363.

M. Krivelevich, B. Sudakov and V. Vu,
Covering codes with improved density,
IEEE Transactions on Information Theory 49 (2003), 18121815.

N. Alon, M. Krivelevich and B. Sudakov,
Induced
subgraphs of prescribed size, J. Graph Theory 43 (2003), 239251.

M. Krivelevich and B. Sudakov,
Approximate coloring of uniform hypergraphs,
J. of Algorithms 49 (2003), 212.
Another
version of this paper with additional results appeared in:
Proc. of the 6th Annual European
Symposium on Algorithms (ESA'98),
Lecture Notes in Computer Science 1461, Springer Verlag
(1998), 477489.

N. Alon, B. Bollobas, M. Krivelevich and B. Sudakov,
Maximum cuts and judicious partitions in graphs without short cycles,
J. Combinatorial Theory Ser. B 88 (2003), 329346.

B. Sudakov,
Few
remarks on the RamseyTurantype problems, J. Combinatorial Theory
Ser. B 88 (2003), 99106.

P.Keevash and B. Sudakov,
Local
density in graphs with forbidden subgraphs, Combinatorics, Probability
and Computing 12 (2003), 139153.

M. Krivelevich, B. Sudakov, V. Vu and N. Wormald,
On the probability of independent sets in random graphs, Random
Structures and Algorithms 22 (2003), 114.

M. Krivelevich and B. Sudakov,
Sparse
pseudorandom graphs are Hamiltonian, J. Graph Theory 42 (2003), 1733.

M. Krivelevich and B. Sudakov,
The
largest eigenvalue of sparse random graphs, Combinatorics, Probability
and Computing 12 (2003), 6172.
2002

M. Krivelevich, B. Sudakov and V. Vu,
Sharp
threshold for network reliability, Combinatorics, Probability and
Computing 11 (2002), 465474.

J.H. Kim, B. Sudakov and V. Vu,
On
asymmetry of random graphs and random regular graphs, Random Structures
and Algorithms 21 (2002), 216224.

B. Reed and B. Sudakov,
Asymptotically
the list colouring constants are 1, J. Combinatorial Theory Ser. B
86 (2002), 2737.

B. Reed and B. Sudakov,
List
colouring of graphs with at most
(2o(1))
vertices,
Proc. of the International Congress of Mathematicians,
Vol III (Beijing 2002), Higher Education Press, China, 587603.

V. Grolmusz and B. Sudakov,
On
kwise setintersections and kwise hammingdistances, J. Combinatorial
Theory Ser. A 99 (2002), 180190.

N. Alon, B. Sudakov and U. Zwick,
Constructing
worst case instances for semidefinite programming based approximation algorithms,,
SIAM J. Discrete Math 15 (2002), 5872.
A preliminary version appeared in: Proc. of the 12th Annual ACMSIAM
SODA, ACM Press (2001), 92100.

B. Sudakov, A
note on odd cyclecomplete graph Ramsey numbers, The Electronic J.
of Combinatorics 9 (2002), N 1, 4pp.
2001

A. Kelmans, D. Mubayi and B. Sudakov,
Asymptotically
optimal treepackings in regular graphs, The Electronic J. of Combinatorics
8 (2001), R 38, 8pp.

M. Krivelevich, R.Nathaniel and B. Sudakov,
Approximating
coloring and maximum independent set in 3uniform hypergraphs, J. of
Algorithm 41 (2001), 99113.
An extended abstract appeared in: Proc. of the 12th Annual ACMSIAM
SODA, ACM Press (2001), 327328.

B. Sudakov,
Nowherezero
flows in random graphs, J. Combinatorial Theory Ser. B 81 (2001), 209223.

N. Alon, B. Sudakov and A. Zaks,
Acyclic
edge colorings of graphs, J. Graph Theory 37 (2001), 157167.

M. Krivelevich, B. Sudakov, V. Vu and N. Wormald,
Random
regular graphs of high degree, Random Structures and Algorithms 18
(2001), 346363.
19952000 (prior to my graduation)

N. Alon and B. Sudakov, Bipartite
subgraphs and the smallest eigenvalue, Combinatorics, Probability and
Computing 9 (2000), 112.

N. Alon, M. Krivelevich and B. Sudakov, Coloring
graphs with sparse neighborhoods, J. Combinatorial Theory Ser. B. 77
(1999), 7382.

N. Alon and B. Sudakov, On
two segmentation problems, J. of Algorithm 33 (1999), 173184.

N. Alon, M. Krivelevich and B. Sudakov,
List
coloring of random and pseudorandom graphs, Combinatorica 19 (1999),
453472.

G. Gutin, B. Sudakov and A. Yeo, Note
on alternating directed cycles, Discrete Mathematics 191 (1998), 101107.

M. Krivelevich and B. Sudakov, The
chromatic numbers of random hypergraphs, Random Structures and Algorithms
12 (1998), 381403.

M. Krivelevich and B. Sudakov, Coloring
random graphs, Information Processing Letters 67 (1998), 7174.

N. Alon, M. Krivelevich and B. Sudakov, Finding
a large hidden clique in a random graph, Random Structures and Algorithms
13 (1998), 457466.
A preliminary version appeared in: Proc. of the 9th Annual ACMSIAM
SODA, ACM Press (1998), 594598.

B. Sudakov, A
note on $\tau$critical linear hypergraphs, Graph and Combinatorics
13 (1997), 281285.

N. Alon, M. Krivelevich and B. Sudakov, Subgraphs
with large cochromatic number, J. Graph Theory 25 (1997), 295297.

N. Alon and B. Sudakov,
Disjoint
Systems, Random Structures and Algorithms 6 (1995), 1320.
A preliminary version appeared in:
Lecture Notes in Computer Science 781, Springer Verlag (1994), 159163.