39 citations · 146 across the 54 of their papers we have counts for
5 papers · 1 filter
New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
Dong Yeap Kang, Daniela Kühn, Abhishek Methuku +1
Let be a -uniform -regular simple hypergraph on vertices. Based on an analysis of the Rödl nibble, Alon, Kim and Spencer (1997) proved that if , then con…
On -uniform hypergraphs avoiding a cycle of length four
Beka Ergemlidze, Ervin Győri, Abhishek Methuku +2
In this note we show that the maximum number of edges in a -uniform hypergraph without a Berge cycle of length four is at most . This improves…
On the Turán number of the blow-up of the hexagon
Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy
The -blowup of a graph , denoted by , is the graph obtained by replacing the vertices and edges of with independent sets of size and copies of , respec…
The exact linear Turán number of the Sail
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
A hypergraph is linear if any two of its edges intersect in at most one vertex. The Sail (or -fan) is the -uniform linear hypergraph consisting of edges $f_1, f_2,…
Turán problems for Edge-ordered graphs
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +3
In this paper we initiate a systematic study of the Turán problem for edge-ordered graphs. A simple graph is called , if its edges are linearly ordered. An i…