BSBenny Sudakov

Benny Sudakov

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Benny Sudakov has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Hereditary quasirandomness without regularity

    by David Conlon, Jacob Fox, Benny Sudakov

    A result of Simonovits and S\'os states that for any fixed graph $H$ and any $\epsilon > 0$ there exists $\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \pm \delta n^{v(H)}$ labeled copies of $H$, then $G$ is quasirandom in the sense that every $S \subseteq V(G)$ contains $\frac{1}{2} p |S|^2 \pm \epsilon n^2$ edges. The original proof of this result makes heavy use of the regularity lemma, resulting in a bound on $\delta^{-1}$ which is a tower of twos of height polynomial in $\epsilon^{-1}$. We give an alternative proof of this theorem which avoids the regularity lemma and shows that $\delta$ may be taken to be linear in $\epsilon$ when $H$ is a clique and polynomial in $\epsilon$ for general $H$. This answers a problem raised by Simonovits and S\'os.

  • Open Access

    Bounded-degree spanning trees in randomly perturbed graphs

    by Michael Krivelevich, Matthew Kwan, Benny Sudakov

    We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into fixed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Specifically, we show that there is $c = c(\alpha,\Delta)$ such that if G is an n-vertex graph with minimum degree at least $\alpha n$, and T is an n-vertex tree with maximum degree at most $\Delta$ , then if we add cn uniformly random edges to G, the resulting graph will contain T asymptotically almost surely (as $n\to\infty$ ). Our proof uses a lemma concerning the decomposition of a dense graph into super-regular pairs of comparable sizes, which may be of independent interest.

  • Open Access

    Finding paths in sparse random graphs requires many queries

    by Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira

    We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\sim {\mathcal G}(n,p)$ in order to find a subgraph which possesses some target property with high probability. In this paper we focus on finding long paths in $G\sim \mathcal G(n,p)$ when $p=\frac{1+\varepsilon}{n}$ for some fixed constant $\varepsilon>0$. This random graph is known to have typically linearly long paths. To have $\ell$ edges with high probability in $G\sim \mathcal G(n,p)$ one clearly needs to query at least $\Omega\left(\frac{\ell}{p}\right)$ pairs of vertices. Can we find a path of length $\ell$ economically, i.e., by querying roughly that many pairs? We argue that this is not possible and one needs to query significantly more pairs. We prove that any randomised algorithm which finds a path of length $\ell=\Omega\left(\frac{\log\left(\frac{1}{\varepsilon}\right)}{\varepsilon}\right)$ with at least constant probability in $G\sim \mathcal G(n,p)$ with $p=\frac{1+\varepsilon}{n}$ must query at least $\Omega\left(\frac{\ell}{p\varepsilon \log\left(\frac{1}{\varepsilon}\right)}\right)$ pairs of vertices. This is tight up to the $\log\left(\frac{1}{\varepsilon}\right)$ factor.

  • Open Access

    Finding Hamilton cycles in random graphs with few queries

    by Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira

    We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mathcal G}(n,p)$ in order to typically find a subgraph possessing a given target property. We show that if $p\geq \frac{\ln n+\ln\ln n+\omega(1)}{n}$, then one can find a Hamilton cycle with high probability after exposing $(1+o(1))n$ edges. Our result is tight in both $p$ and the number of exposed edges.

  • Open Access

    Testing Equality in Communication Graphs

    by Noga Alon, Klim Efremenko, Benny Sudakov

    Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed communication protocol, and the players must decide, deterministically, if their inputs are all equal. What is the minimum possible total number of bits transmitted in a protocol solving this problem ? We determine this minimum up to a lower order additive term in many cases (but not for all graphs). In particular, we show that it is $kn/2+o(n)$ for any Hamiltonian $k$-vertex graph, and that for any $2$-edge connected graph with $m$ edges containing no two adjacent vertices of degree exceeding $2$ it is $mn/2+o(n)$. The proofs combine graph theoretic ideas with tools from additive number theory.

  • Open Access

    Short proofs of some extremal results II

    by David Conlon, Jacob Fox, Benny Sudakov

    We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are quite short.

  • Open Access

    Cycles and matchings in randomly perturbed digraphs and hypergraphs

    by Michael Krivelevich, Matthew Kwan, Benny Sudakov

    We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to a dense k-uniform hypergraph ensures the (asymptotically almost sure) existence of a perfect matching or a loose Hamilton cycle. The proof involves an interesting application of Szemer\'edi's Regularity Lemma, which might be independently useful. We next prove that digraphs with certain strong expansion properties are pancyclic, and use this to show that adding a linear number of random edges typically makes a dense digraph pancyclic. Finally, we prove that perturbing a certain (minimum-degree-dependent) number of random edges in a tournament typically ensures the existence of multiple edge-disjoint Hamilton cycles. All our results are tight.

  • Open Access

    On the maximum quartet distance between phylogenetic trees

    by Noga Alon, Humberto Naves, Benny Sudakov

    A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on $n$ leaves is at most $(\frac 23 +o(1))\binom{n}{4}$. Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most $(0.69 +o(1))\binom{n}{4}$. We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most $(\frac 23 +o(1))\binom{n}{4}$.

  • Open Access

    Compatible Hamilton cycles in random graphs

    by Michael Krivelevich, Choongbum Lee, Benny Sudakov

    A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is asymptotically almost surely Hamiltonian. We obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\em incompatibility system} $\mathcal{F}$ over $G$ is a family $\mathcal{F}=\{F_v\}_{v\in V}$ where for every $v\in V$, the set $F_v$ is a set of unordered pairs $F_v \subseteq \{\{e,e'\}: e\ne e'\in E, e\cap e'=\{v\}\}$. An incompatibility system is {\em $\Delta$-bounded} if for every vertex $v$ and an edge $e$ incident to $v$, there are at most $\Delta$ pairs in $F_v$ containing $e$. We say that a cycle $C$ in $G$ is {\em compatible} with $\mathcal{F}$ if every pair of incident edges $e,e'$ of $C$ satisfies $\{e,e'\} \notin F_v$. This notion is partly motivated by a concept of transition systems defined by Kotzig in 1968, and can be used as a quantitative measure of robustness of graph properties. We prove that there is a constant $\mu>0$ such that the random graph $G=G(n,p)$ with $p(n) \gg \frac{\log n}{n}$ is asymptotically almost surely such that for any $\mu np$-bounded incompatibility system $\mathcal{F}$ over $G$, there is a Hamilton cycle in $G$ compatible with $\mathcal{F}$. We also prove that for larger edge probabilities $p(n)\gg \frac{\log^8n}{n}$, the parameter $\mu$ can be taken to be any constant smaller than $1-\frac{1}{\sqrt 2}$. These results imply in particular that typically in $G(n,p)$ for $p \gg \frac{\log n}{n}$, for any edge-coloring in which each color appears at most $\mu np$ times at each vertex, there exists a properly colored Hamilton cycle.

  • Open Access

    Compatible Hamilton cycles in Dirac graphs

    by Michael Krivelevich, Choongbum Lee, Benny Sudakov

    A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on $n\ge 3$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph $G=(V,E)$, an {\em incompatibility system} $\mathcal{F}$ over $G$ is a family $\mathcal{F}=\{F_v\}_{v\in V}$ such that for every $v\in V$, the set $F_v$ is a set of unordered pairs $F_v \subseteq \{\{e,e'\}: e\ne e'\in E, e\cap e'=\{v\}\}$. An incompatibility system is {\em $\Delta$-bounded} if for every vertex $v$ and an edge $e$ incident to $v$, there are at most $\Delta$ pairs in $F_v$ containing $e$. We say that a cycle $C$ in $G$ is {\em compatible} with $\mathcal{F}$ if every pair of incident edges $e,e'$ of $C$ satisfies $\{e,e'\} \notin F_v$, where $v=e\cap e'$. This notion is partly motivated by a concept of transition systems defined by Kotzig in 1968, and can be viewed as a quantitative measure of robustness of graph properties. We prove that there is a constant $\mu>0$ such that for every $\mu n$-bounded incompatibility system $\mathcal{F}$ over a Dirac graph $G$, there exists a Hamilton cycle compatible with $\mathcal{F}$. This settles in a very strong form, a conjecture of H\"{a}ggkvist from 1988.