Name
Affiliation
Papers
ABHISHEK METHUKU
Cent European Univ, Dept Math, Budapest, Hungary
26
Collaborators
Citations 
PageRank 
43
18
9.98
Referers 
Referees 
References 
32
56
37
Title
Citations
PageRank
Year
Generalized rainbow Turan problems00.342022
A proof of the Erd.os-Faber-Lovasz conjecture: Algorithmic aspects00.342021
Edge Colorings Of Graphs Without Monochromatic Stars00.342020
A Simple Proof for a Forbidden Subposet Problem00.342020
On clique coverings of complete multipartite graphs00.342020
New bounds for a hypergraph Bipartite Tur\'an problem00.342020
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs00.342020
Saturation of Berge hypergraphs.00.342019
Linearity of saturation for Berge hypergraphs.00.342019
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.00.342019
On the Number of Containments in P-free Families.00.342019
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.00.342019
Asymptotics for the Turán number of Berge-.10.362019
Asymptotics for the Turán number of Berge-K2,10.362019
On the Weight of Berge-F-Free Hypergraphs.00.342019
3-uniform hypergraphs and linear cycles.00.342018
On the Turán number of some ordered even cycles.00.342018
An Erdős-Gallai type theorem for uniform hypergraphs.30.832018
An upper bound on the size of diamond-free families of sets.30.412018
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.00.342018
On the maximum size of connected hypergraphs without a path of given length.00.342018
Intersecting P-free families.00.342017
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs.10.382017
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems90.892017
De Bruijn-Erdős-type theorems for graphs and posets.00.342017
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle00.342015