49 citations · 606 across the 189 of their papers we have counts for
259 papers
Difference-Isomorphic Graph Families
Lior Gishboliner, Zhihan Jin, Benny Sudakov
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One pr…
The growth rate of multicolor Ramsey numbers of -graphs
Domagoj Bradač, Jacob Fox, Benny Sudakov
The -color Ramsey number of a -uniform hypergraph denoted , is the minimum integer such that any coloring of the edges of the complete -uniform hypergraph…
Positive discrepancy, MaxCut, and eigenvalues of graphs
Eero Räty, Benny Sudakov, István Tomon
The positive discrepancy of a graph of edge density is defined as $$\mbox{disc}^{+}(G)=\max_{U\subset V(G)}e(G[U])-p\binom{|U|}{2}.$$ In 1993, Alon pro…
Optimal Hamilton covers and linear arboricity for random graphs
Nemanja Draganić, Stefan Glock, David Munhá Correia +1
In his seminal 1976 paper, Pósa showed that for all , the binomial random graph is with high probability Hamiltonian. This leads to the following natural…
Ascending Subgraph Decomposition
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy +1
A typical theme for many well-known decomposition problems is to show that some obvious necessary conditions for decomposing a graph into copies are also suf…
The extremal number of cycles with all diagonals
Domagoj Bradač, Abhishek Methuku, Benny Sudakov
In 1975, Erdős asked the following natural question: What is the maximum number of edges that an -vertex graph can have without containing a cycle with all diagonals? Erdős obse…