3 citations · 11 across the 11 of their papers we have counts for
31 papers
Counting cliques in -planar graphs
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2
The problem of maximising the number of cliques among -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…
Ramsey numbers of Boolean lattices
Dániel Grósz, Abhishek Methuku, Casey Tompkins
The poset Ramsey number is the smallest integer such that any blue-red coloring of the elements of the Boolean lattice has a blue induced copy of or a…
Minimizing the number of complete bipartite graphs in a -saturated graph
Beka Ergemlidze, Abhishek Methuku, Michael Tait +1
A graph is -saturated if it contains no copy of as a subgraph but the addition of any new edge to creates a copy of . We prove that for and ,…
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…
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,…
Generalized rainbow Turán problems
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku +1
Alon and Shikhelman initiated the systematic study of the following generalized Turán problem: for fixed graphs and and an integer , what is the maximum number of copies…