Benny Sudakov

From MaRDI portal
Person:1584432

Available identifiers

zbMath Open sudakov.bennyDBLP77/4142WikidataQ4890055 ScholiaQ4890055MaRDI QIDQ1584432

List of research outcomes





PublicationDate of PublicationType
Effective bounds for induced size-Ramsey numbers of cycles2025-01-14Paper
Cycles with many chords2024-11-20Paper
Hamilton cycles in pseudorandom graphs2024-11-18Paper
Maximal chordal subgraphs2024-11-05Paper
Regular subgraphs of linear hypergraphs2024-10-31Paper
Evasive sets, covering by subspaces, and point-hyperplane incidences2024-10-25Paper
The extremal number of cycles with all diagonals2024-10-25Paper
Small subgraphs with large average degree2024-09-19Paper
The intersection spectrum of 3-chromatic intersecting hypergraphs2024-09-13Paper
Chvátal-Erdős condition for pancyclicity2024-09-10Paper
The growth rate of multicolor Ramsey numbers of 3-graphs2024-08-15Paper
On the Turán number of the hypercube2024-03-19Paper
The minimum degree removal lemma thresholds2024-03-14Paper
On Ramsey Size-Linear Graphs and Related Questions2024-01-23Paper
The growth rate of multicolor Ramsey numbers of $3$-graphs2023-12-21Paper
Difference-Isomorphic Graph Families2023-12-11Paper
Matrix discrepancy and the log-rank conjecture2023-11-30Paper
Power saving for the Brown-Erd\H{o}s-S\'os problem2023-11-21Paper
Note on the second eigenvalue of regular graphs2023-11-13Paper
Positive discrepancy, MaxCut, and eigenvalues of graphs2023-11-03Paper
Optimal Hamilton covers and linear arboricity for random graphs2023-10-17Paper
Clique minors in graphs with a forbidden subgraph2023-10-12Paper
Complete minors and average degree: A short proof2023-10-12Paper
Uniform chain decompositions and applications2023-10-12Paper
Asymptotics of the hypergraph bipartite Turán problem2023-10-04Paper
Large independent sets from local considerations2023-10-04Paper
The intersection spectrum of 3‐chromatic intersecting hypergraphs2023-09-20Paper
The extremal number of cycles with all diagonals2023-08-30Paper
Extremal, enumerative and probabilistic results on ordered hypergraph matchings2023-08-23Paper
The Turán number of the grid2023-08-23Paper
New results for MaxCut in H$H$‐free graphs2023-08-23Paper
Ascending Subgraph Decomposition2023-08-22Paper
Ramsey numbers of hypergraphs of a given size2023-08-21Paper
Short Proofs of Rainbow Matchings Results2023-08-15Paper
Resolution of the Erdős–Sauer problem on regular subgraphs2023-08-10Paper
Ramsey problems for monotone paths in graphs and hypergraphs2023-08-08Paper
Cycles with many chords2023-06-15Paper
On MaxCut and the Lov\'asz theta function2023-05-29Paper
Which graphs can be counted in \(C_4\)-free graphs?2023-04-05Paper
Universal and unavoidable graphs2023-03-30Paper
Powers of paths in tournaments2023-03-30Paper
Hamilton cycles in pseudorandom graphs2023-03-09Paper
A generalization of Bondy's pancyclicity theorem2023-02-24Paper
The regularity method for graphs with few 4‐cycles2023-02-10Paper
Effective bounds for induced size-Ramsey numbers of cycles2023-01-24Paper
Chv\'atal-Erd\H{o}s condition for pancyclicity2023-01-24Paper
Turán numbers of sunflowers2023-01-10Paper
Counting H-free orientations of graphs2022-12-20Paper
Threshold Ramsey multiplicity for odd cycles2022-11-29Paper
Tight bounds for powers of Hamilton cycles in tournaments2022-11-28Paper
Ramsey properties of algebraic graphs and hypergraphs2022-10-31Paper
Lower bounds for max-cut via semidefinite programming2022-10-13Paper
Threshold Ramsey multiplicity for paths and even cycles2022-10-07Paper
Ramsey number of 1-subdivisions of transitive tournaments2022-09-23Paper
Pancyclicity of Hamiltonian graphs2022-09-07Paper
Cycles of many lengths in Hamiltonian graphs2022-09-06Paper
Regular subgraphs of linear hypergraphs2022-08-22Paper
Evasive sets, covering by subspaces, and point-hyperplane incidences2022-07-26Paper
The \(n\)-queens completion problem2022-07-22Paper
The Extremal Number of Tight Cycles2022-07-13Paper
Small subgraphs with large average degree2022-07-05Paper
On the densities of cliques and independent sets in graphs2022-06-29Paper
Maximal Chordal Subgraphs2022-05-17Paper
\(C_4\)-free subgraphs with large average degree2022-04-25Paper
New bounds for Ryser’s conjecture and related problems2022-04-22Paper
An average degree condition for independent transversals2022-03-03Paper
Infinite Sperner's theorem2022-01-20Paper
Proof of Grinblat's conjecture on rainbow matchings in multigraphs2021-10-04Paper
A proof of Ringel's conjecture2021-10-04Paper
Isomorphic bisections of cubic graphs2021-09-16Paper
Proof of the Brown-Erdős-Sós conjecture in groups2021-09-14Paper
Tight Ramsey bounds for multiple copies of a graph2021-08-26Paper
Covering graphs by monochromatic trees and Helly-type results for hypergraphs2021-08-03Paper
Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming2021-07-23Paper
Acyclic subgraphs of tournaments with high chromatic number2021-07-02Paper
Tournament quasirandomness from local counting2021-06-29Paper
Monochromatic trees in random tournaments2021-06-15Paper
Flattening rank and its combinatorial applications2021-06-11Paper
Large cliques and independent sets all over the place2021-06-10Paper
Which graphs can be counted in $C_4$-free graphs?2021-06-06Paper
Small doubling, atomic structure and $\ell$-divisible set families2021-03-30Paper
Large induced matchings in random graphs2021-03-17Paper
A remark on Hamilton cycles with few colors2021-03-12Paper
Halfway to Rota’s Basis Conjecture2021-03-11Paper
Long directed paths in Eulerian digraphs2021-01-27Paper
Number of 1-factorizations of regular high-degree graphs2021-01-25Paper
Short proofs of some extremal results. III2021-01-05Paper
The Kőnig graph process2021-01-05Paper
Embedding rainbow trees with applications to graph labelling and decomposition2020-12-17Paper
Ramsey goodness of cycles2020-10-27Paper
Asymptotics in percolation on high-girth expanders2020-10-26Paper
Orthonormal representations of \(H\)-free graphs2020-10-23Paper
A Note on Powers of Paths in Tournaments2020-10-15Paper
Completion and deficiency problems2020-09-24Paper
Bounded degree spanners of the hypercube2020-07-29Paper
3-color bipartite Ramsey number of cycles and paths2020-07-17Paper
2-factors with \(k\) cycles in Hamiltonian graphs2020-07-07Paper
The oriented size Ramsey number of directed paths2020-06-16Paper
Long directed rainbow cycles and rainbow spanning trees2020-06-16Paper
Counting odd cycle free orientations of graphs2020-06-02Paper
Turán number of bipartite graphs with no \(K_{t,t}\)2020-05-27Paper
Ramsey graphs induce subgraphs of quadratically many sizes2020-05-04Paper
The regularity method for graphs with few 4-cycles2020-04-21Paper
Long monotone trails in random edge-labellings of random graphs2020-04-06Paper
Submodular minimization under congruency constraints2020-02-26Paper
Books versus triangles at the extremal density2020-02-13Paper
An extremal problem for integer sparse recovery2019-12-19Paper
Decompositions into spanning rainbow structures2019-11-28Paper
An algebraic perspective on integer sparse recovery2019-11-22Paper
Tower-type bounds for unavoidable patterns in words2019-10-31Paper
Proof of a conjecture on induced subgraphs of Ramsey graphs2019-10-24Paper
Hypergraph cuts above the average2019-10-08Paper
Multicolour bipartite Ramsey number of paths2019-09-30Paper
Robustness of graph properties2019-09-25Paper
Counting Hamilton decompositions of oriented graphs2019-09-09Paper
Directed Ramsey number for trees2019-07-17Paper
A counterexample to Stein's equi-\(n\)-square conjecture2019-05-23Paper
Equiangular subspaces in Euclidean spaces2019-04-25Paper
Monochromatic paths in random tournaments2019-02-20Paper
Monochromatic cycle covers in random graphs2019-02-20Paper
The random \(k\)-matching-free process2019-02-20Paper
Counting Hamilton cycles in sparse random directed graphs2019-02-20Paper
The Zero Forcing Number of Graphs2019-01-16Paper
Independent arithmetic progressions2019-01-15Paper
On Kahn's basis conjecture2018-10-17Paper
Linearly many rainbow trees in properly edge-coloured complete graphs2018-07-24Paper
Anagram-free colourings of graphs2018-07-24Paper
Packing Hamilton cycles online2018-07-24Paper
On the maximum quartet distance between phylogenetic trees2018-07-16Paper
Two-Sided, Unbiased Version of Hall’s Marriage Theorem2018-07-13Paper
Hereditary quasirandomness without regularity2018-07-13Paper
Testing Equality in Communication Graphs2018-06-27Paper
Intercalates and discrepancy in random Latin squares2018-06-07Paper
Ramsey goodness of bounded degree trees2018-04-23Paper
Cycles in triangle-free graphs of large chromatic number2018-04-12Paper
Submodular minimization under congruency constraints2018-03-15Paper
Embedding rainbow trees with applications to graph labelling and decomposition2018-03-08Paper
On the densities of cliques and independent sets in graphs2018-02-22Paper
Compatible Hamilton cycles in Dirac graphs2018-02-12Paper
Equiangular lines and spherical codes in Euclidean space2018-01-26Paper
Monochromatic paths in random tournaments2018-01-18Paper
Directed Ramsey number for trees2018-01-18Paper
Equiangular lines and subspaces in Euclidean spaces2018-01-18Paper
Edge-disjoint rainbow trees in properly coloured complete graphs2018-01-18Paper
Anagram-free colorings of graphs2018-01-18Paper
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles2017-12-21Paper
The number of Hamiltonian decompositions of regular graphs2017-12-21Paper
Supersaturation in posets and applications involving the container method2017-11-09Paper
Cycles and matchings in randomly perturbed digraphs and hypergraphs2017-10-10Paper
The threshold probability for long cycles2017-10-10Paper
Maximizing the number of independent sets of a fixed size2017-10-04Paper
Sperner's theorem and a problem of Erdős, Katona and Kleitman2017-10-04Paper
Decomposing random graphs into few cycles and edges2017-10-04Paper
The number of additive triples in subsets of abelian groups2017-09-28Paper
Saturation in random graphs2017-09-26Paper
On graphs decomposable into induced matchings of linear sizes2017-09-13Paper
Bounded colorings of multipartite graphs and hypergraphs2017-09-11Paper
The minimum number of disjoint pairs in set systems and related problems2017-04-25Paper
Ramsey numbers of cubes versus cliques2017-03-31Paper
The extremal function for cycles of length \(\ell\) mod \(k\)2017-02-17Paper
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs2017-01-27Paper
Recent developments in graph Ramsey theory2016-12-20Paper
Domination in 3-tournaments2016-11-29Paper
Properly colored and rainbow copies of graphs with few cherries2016-11-25Paper
Counting and packing Hamilton cycles in dense graphs and oriented graphs2016-11-25Paper
Ramsey goodness of paths2016-11-25Paper
Ordered Ramsey numbers2016-11-25Paper
Some remarks on rainbow connectivity2016-11-17Paper
Compatible Hamilton cycles in random graphs2016-11-09Paper
Some remarks on rainbow connectivity2016-10-14Paper
Properly colored and rainbow copies of graphs with few cherries2016-10-14Paper
Cycles and matchings in randomly perturbed digraphs and hypergraphs2016-10-14Paper
A random triadic process2016-10-14Paper
Almost-Fisher families2016-10-14Paper
Short proofs of some extremal results. II.2016-10-12Paper
Random directed graphs are robustly Hamiltonian2016-09-15Paper
Small complete minors above the extremal edge density2016-09-09Paper
Coloring random graphs2016-06-09Paper
On the maximum quartet distance between phylogenetic trees2016-04-15Paper
Bounds for spherical codes2016-02-24Paper
Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs2016-02-19Paper
Judicious partitions of directed graphs2016-02-03Paper
A random triadic process2016-01-15Paper
Discrepancy of random graphs and hypergraphs2015-10-12Paper
On the grid Ramsey problem and related questions2015-10-02Paper
On the number of monotone sequences2015-08-21Paper
Comparable pairs in families of sets2015-08-21Paper
Cycle packing2015-06-22Paper
Swarming on random graphs. II2015-05-08Paper
Most probably intersecting hypergraphs2015-04-22Paper
Long paths and cycles in random subgraphs of graphs with large minimum degree2015-04-09Paper
Ramsey-type results for semi-algebraic relations2015-02-17Paper
The Erdős-Gyárfás problem on generalized Ramsey numbers2015-01-26Paper
A construction of almost Steiner systems2014-12-22Paper
Musical Chairs2014-12-22Paper
\(K_{s,t}\)-saturated bipartite graphs2014-12-19Paper
Bisections of graphs2014-10-13Paper
A problem of Erdős on the minimum number of \(k\)-cliques2014-10-06Paper
Ramsey-type results for semi-algebraic relations2014-09-19Paper
How many colors guarantee a rainbow matching?2014-09-04Paper
The minimum number of nonnegative edges in hypergraphs2014-09-04Paper
Turán numbers of bipartite graphs plus an odd cycle2014-08-28Paper
Cores of random graphs are born Hamiltonian2014-08-08Paper
On the 3-local profiles of graphs2014-08-07Paper
Robust Hamiltonicity of Dirac graphs2014-06-11Paper
Nearly complete graphs decomposable into large induced matchings and their applications2014-05-13Paper
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz2014-05-05Paper
Short proofs of some extremal results2014-05-02Paper
On a conjecture of Erdős and Simonovits: even cycles2014-03-17Paper
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs2014-02-24Paper
All-pairs shortest paths in \(O(n^2)\) time with high probability2014-02-17Paper
Two extensions of Ramsey's theorem2014-01-27Paper
Large subgraphs without complete bipartite graphs2014-01-26Paper
An improved bound for the stepping-up lemma2013-11-29Paper
On two problems in graph Ramsey theory2013-11-07Paper
Maximum union-free subfamilies2013-11-01Paper
The phase transition in random graphs: a simple proof2013-10-09Paper
Self-similarity of graphs2013-09-26Paper
Nearly complete graphs decomposable into large induced matchings and their applications2013-09-02Paper
Longest cycles in sparse random digraphs2013-08-27Paper
Rainbow Turán problem for even cycles2013-03-19Paper
Decompositions into subgraphs of small diameter2013-03-13Paper
Erdős-Szekeres-type theorems for monotone paths and convex bodies2012-11-30Paper
Dirac's theorem for random graphs2012-10-31Paper
Erdős-Hajnal-type theorems in hypergraphs2012-10-19Paper
A counterexample to the Alon-Saks-Seymour conjecture and related problems2012-09-17Paper
Getting a directed Hamilton cycle two times faster2012-09-12Paper
Sidorenko's conjecture for a class of graphs: an exposition2012-09-02Paper
Long cycles in subgraphs of (pseudo)random directed graphs2012-07-10Paper
Long paths and cycles in random subgraphs of graphs with large minimum degree2012-07-02Paper
The size of a hypergraph and its matching number2012-06-04Paper
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels2012-06-04Paper
Biased orientation games2012-05-30Paper
The size Ramsey number of a directed path2012-05-11Paper
Nonnegative \(k\)-sums, fractional covers, and probability of small deviations2012-05-11Paper
Hamiltonicity, independence number, and pancyclicity2012-05-04Paper
Bandwidth theorem for random graphs2012-03-19Paper
A bound for the cops and robbers problem2012-03-15Paper
On the resilience of hamiltonicity and optimal packing of Hamilton cycles in random graphs2012-03-15Paper
Recent developments in extremal combinatorics: Ramsey and Turán type problems2011-11-11Paper
Oblivious Collaboration2011-10-28Paper
Generating all subsets of a finite set with disjoint unions2011-10-21Paper
Cycles in graphs with large independence ratio2011-08-23Paper
Spectra of lifted Ramanujan graphs2011-07-25Paper
A randomized embedding algorithm for trees2011-07-22Paper
Increasing the chromatic number of a random graph2011-06-27Paper
Regular induced subgraphs of a random graph2011-05-11Paper
Large almost monochromatic subsets in hypergraphs2011-05-05Paper
A conjecture of Erdős on graph Ramsey numbers2011-04-20Paper
Resilient pancyclicity of random and pseudorandom graphs2011-03-15Paper
Local resilience and hamiltonicity maker-breaker games in random regular graphs2011-03-07Paper
Dependent random choice2011-01-17Paper
Ramsey games with giants2011-01-17Paper
An approximate version of Sidorenko's conjecture2011-01-07Paper
Maximizing the number of q -colorings2010-11-26Paper
Hamiltonicity thresholds in Achlioptas processes2010-11-24Paper
Ramsey numbers of sparse hypergraphs2010-11-09Paper
Cycles in Sparse Graphs II2010-10-25Paper
Hypergraph Ramsey numbers2010-08-27Paper
Simulating independence2010-08-16Paper
Density theorems for bipartite graphs and related Ramsey-type results2010-08-13Paper
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors2010-07-14Paper
Pancyclicity of Hamiltonian and highly connected graphs2010-06-03Paper
Directed graphs without short cycles2010-04-23Paper
Constrained Ramsey numbers2010-04-23Paper
On the random satisfiable process2010-04-22Paper
Paths and stability number in digraphs2010-03-26Paper
Ramsey-type problem for an almost monochromatic \(K_4\)2010-03-17Paper
Discrete Kakeya-type problems and small bases2010-01-26Paper
Two remarks on the Burr-Erdős conjecture2009-11-30Paper
Large Nearly Regular Induced Subgraphs2009-11-27Paper
Additive approximation for edge-deletion problems2009-07-15Paper
Minors in expanding graphs2009-07-06Paper
Triangle packings and 1-factors in oriented graphs2009-06-23Paper
Avoiding small subgraphs in Achlioptas processes2009-03-04Paper
Local resilience of graphs2009-03-04Paper
Large induced trees in \(K_r\)-free graphs2009-03-04Paper
Covering codes with improved density2008-12-21Paper
Unavoidable patterns2008-12-08Paper
Ramsey Numbers and the Size of Graphs2008-12-05Paper
Induced Ramsey-type theorems2008-11-12Paper
Embedding nearly-spanning bounded degree trees2008-10-22Paper
Making a \(K_4\)-free graph bipartite2008-10-22Paper
Cycle lengths in sparse graphs2008-10-21Paper
On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs2008-10-07Paper
On the strong chromatic number of random graphs2008-07-21Paper
Induced Ramsey-type theorems2008-06-05Paper
Constrained Ramsey Numbers2008-06-05Paper
How many random edges make a dense hypergraph non-2-colorable?2008-06-05Paper
The game chromatic number of random graphs2008-03-28Paper
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality2008-02-22Paper
On graphs with subgraphs having large independence numbers2008-01-04Paper
Independent transversals in locally sparse graphs2007-10-10Paper
Nearly optimal embeddings of trees2007-07-13Paper
Induced subgraphs of Ramsey graphs with many distinct degrees2007-06-08Paper
Small subgraphs of random regular graphs2007-05-23Paper
Rainbow Turán Problems2007-03-20Paper
A Ramsey-type result for the hypercube2007-02-07Paper
On smoothed analysis in dense graphs and formulas2007-02-07Paper
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs2007-01-16Paper
On a restricted cross-intersection problem2006-12-07Paper
Bounding the number of edges in permutation graphs2006-08-30Paper
Sparse halves in triangle-free graphs2006-07-12Paper
Pseudo-random graphs2006-06-29Paper
On a hypergraph Turán problem of Frankl2006-06-27Paper
A new lower bound for a Ramsey-type problem2006-06-27Paper
The Turán number of the Fano plane2006-06-27Paper
The Strong Chromatic Index of Random Graphs2006-06-01Paper
\(H\)-free graphs of large minimum degree2006-03-22Paper
MaxCut in ${\bm H)$-Free Graphs2005-11-14Paper
Disjoint representability of sets and their complements2005-09-28Paper
On a question of Erdős and Moser2005-09-26Paper
Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices2005-09-16Paper
A generalization of Turán's theorem2005-08-01Paper
List colouring when the chromatic number is close to the order of the graph2005-07-05Paper
Triangle factors in sparse pseudo-random graphs2005-07-05Paper
Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems2005-06-01Paper
THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES2005-03-14Paper
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions2005-03-08Paper
On Ramsey Numbers of Sparse Graphs2005-03-08Paper
Graph products, Fourier analysis and spectral techniques2005-02-24Paper
Learning a Hidden Matching2005-02-21Paper
Packing triangles in a graph and its complement2005-02-16Paper
On the value of a random minimum weight Steiner tree2005-02-14Paper
Multicolour Turán problems2004-10-12Paper
Approximate coloring of uniform hypergraphs2004-10-01Paper
Multicoloured extremal problems2004-10-01Paper
On the number of edges not covered by monochromatic copies of a fixed graph.2004-03-15Paper
Extremal set systems with restricted \(k\)-wise intersections.2004-03-14Paper
Local Density in Graphs with Forbidden Subgraphs2003-09-24Paper
A few remarks on Ramsey--Turán-type problems2003-08-25Paper
On the largest eigenvalue of a random subgraph of the hypercube2003-08-21Paper
Induced subgraphs of prescribed size2003-08-20Paper
Maximum cuts and judicious partitions in graphs without short cycles2003-08-17Paper
The Largest Eigenvalue of Sparse Random Graphs2003-06-13Paper
A Sharp Threshold for Network Reliability2003-04-11Paper
On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances2003-03-26Paper
Sparse pseudo‐random graphs are Hamiltonian2003-03-19Paper
On the probability of independent sets in random graphs2003-03-19Paper
On the asymmetry of random regular graphs and random graphs2003-03-19Paper
Nowhere-zero flows in random graphs2002-12-10Paper
Asymptotically the list colouring constants are 12002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45492282002-11-07Paper
Acyclic edge colorings of graphs2002-11-06Paper
Random regular graphs of high degree2002-11-06Paper
Approximating coloring and maximum independent sets in 3-uniform hypergraphs2002-08-01Paper
Constructing worst case instances for semidefinite programming based approximation algorithms2002-04-23Paper
Approximating coloring and maximum independent sets in 3-uniform hypergraphs2002-03-24Paper
A note on odd cycle-complete graph Ramsey numbers2002-02-07Paper
Constructing worst case instances for semidefinite programming based approximation algorithms2002-01-30Paper
Asymptotically optimal tree-packings in regular graphs2001-12-11Paper
Note on alternating directed cycles2000-11-02Paper
Bipartite Subgraphs and the Smallest Eigenvalue2000-10-08Paper
Coloring graphs with sparse neighborhoods2000-06-25Paper
On Two Segmentation Problems2000-06-13Paper
https://portal.mardi4nfdi.de/entity/Q49544202000-06-07Paper
List coloring of random and pseudo-random graphs2000-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47053441999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q47053181999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q42520441999-10-06Paper
https://portal.mardi4nfdi.de/entity/Q42502281999-06-17Paper
Subgraphs with a large cochromatic number1998-03-02Paper
A note on \(\tau\)-critical linear hypergraphs1998-01-21Paper
Disjoint systems1995-02-09Paper
Improved bounds for the Erd\H{o}s-Rogers $(s,s+2)$-problemN/APaper
Incidence bounds via extremal graph theoryN/APaper
K\H{o}v\'ari-S\'os-Tur\'an theorem for hereditary familiesN/APaper
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi GraphsN/APaper
Hamiltonicity of expanders: optimal bounds and applicationsN/APaper
Point-variety incidences, unit distances and Zarankiewicz's problem for algebraic graphsN/APaper
Saturation in Random HypergraphsN/APaper

Research outcomes over time

This page was built for person: Benny Sudakov