39 citations · 146 across the 54 of their papers we have counts for
3 papers · 1 filter
Power saving for the Brown-Erdős-Sós problem
Oliver Janzer, Abhishek Methuku, Aleksa Milojević +1
Let denote the maximum number of edges in a 3-uniform hypergraph on vertices which does not contain vertices spanning at least edges. A central problem in…
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…
Cycles with many chords
Nemanja Draganić, Abhishek Methuku, David Munhá Correia +1
How many edges in an -vertex graph will force the existence of a cycle with as many chords as it has vertices? Almost 30 years ago, Chen, Erdős and Staton considered this questi…