Benny Sudakov

activity

20142023

most cited

K_{s, t}

-saturated bipartite graphs

3 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

Improved bounds for the Erdős-Rogers $(s, s + 2)$ -problem

Oliver Janzer, Benny Sudakov

For $2 \leq s < t$ , the Erdős-Rogers function $f_{s, t} (n)$ measures how large a $K_{s}$ -free induced subgraph there must be in a $K_{t}$ -free graph on $n$ vertices. There has been an exte…

math.CO2022

Complete minors and average degree -- a short proof

Noga Alon, Michael Krivelevich, Benny Sudakov

We provide a short and self-contained proof of the classical result of Kostochka and of Thomason, ensuring that every graph of average degree $d$ has a complete minor of order $d/\…

math.CO2014★ 3 cited

$K_{s, t}$ -saturated bipartite graphs

Wenying Gan, Dániel Korándi, Benny Sudakov

An $n$ -by- $n$ bipartite graph is $H$ -saturated if the addition of any missing edge between its two parts creates a new copy of $H$ . In 1964, Erdős, Hajnal and Moon made a conjectur…

Improved bounds for the Erdős-Rogers (s,s+2)-problem

Complete minors and average degree -- a short proof

Ks,t​-saturated bipartite graphs

Improved bounds for the Erdős-Rogers $(s, s + 2)$ -problem

$K_{s, t}$ -saturated bipartite graphs