Benny Sudakov

activity

20232026

most citedCounting subgraphs in locally dense graphs

1 citations · 2 across the 30 of their papers we have counts for

collaborators

Showing 2025Show all

9 papers · 1 filter

math.CO2025

Gaussian random graphs and Ramsey numbers

Zach Hunter, Aleksa Milojević, Benny Sudakov

We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction bas…

math.CO2025

Ramsey numbers of digraphs with local edge structure

Domagoj Bradač, Patryk Morawski, Benny Sudakov +1

One of the classical topics in graph Ramsey theory is the study of which $n$ -vertex graphs have Ramsey numbers that are linear in $n$ . In this paper, we consider this problem in th…

math.CO2025

Packing subgraphs in regular graphs

Shoham Letzter, Abhishek Methuku, Benny Sudakov

An \emph{ $H$ -packing} in a graph $G$ is a collection of pairwise vertex-disjoint copies of $H$ in $G$ . We prove that for every $c > 0$ and every bipartite graph $H$ , any $\lfloor c…

math.CO2025

Cyclic subsets of tournaments

Zach Hunter, Teng Liu, Aleksa Milojević +1

Let $G$ be a Dirac graph, and let $S$ be a vertex subset of $G$ , chosen uniformly at random. How likely is the induced subgraph $G [S]$ to be Hamiltonian? This question, proposed by…

math.CO2025

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Nemanja Draganić, Jaehoon Kim, Hyunwoo Lee +3

Dirac's classical theorem asserts that, for $n \geq 3$ , any $n$ -vertex graph with minimum degree at least $n /2$ is Hamiltonian. Furthermore, if we additionally assume that such grap…

math.CO2025

$C_{4}$ -free subgraphs of high degree with geometric applications

Zach Hunter, Aleksa Milojević, Istvan Tomon +1

The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$ -vertex graph that does not contain the complete bipartite g…

math-ph2025

The large $N$ factorization does not hold for arbitrary multi-trace observables in random tensors

Razvan Gurau, Felix Joos, Benjamin Sudakov

We consider real tensors of order $D$ , that is $D$ -dimensional arrays of real numbers $T_{a^{1} a^{2} \dots a^{D}}$ , where each index $a^{c}$ can take $N$ values. The tensor entries $T_{a^1…

math.CO2025

Sunflowers and Ramsey problems for restricted intersections

Barnabás Janzer, Zhihan Jin, Benny Sudakov +1

Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 years. In this paper, we study the following Ramsey versi…

math.CO2025

Lower bounds for Ramsey numbers of bounded degree hypergraphs

Domagoj Bradač, Zach Hunter, Benny Sudakov

We prove that, for all $k \geq 3,$ and any integers $Δ, n$ with $n \geq Δ,$ there exists a $k$ -uniform hypergraph on $n$ vertices with maximum degree at most $Δ$ whose $4$ -color Rams…

Gaussian random graphs and Ramsey numbers

Ramsey numbers of digraphs with local edge structure

Packing subgraphs in regular graphs

Cyclic subsets of tournaments

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

C4​-free subgraphs of high degree with geometric applications

The large N factorization does not hold for arbitrary multi-trace observables in random tensors

Sunflowers and Ramsey problems for restricted intersections

Lower bounds for Ramsey numbers of bounded degree hypergraphs

$C_{4}$ -free subgraphs of high degree with geometric applications

The large $N$ factorization does not hold for arbitrary multi-trace observables in random tensors