Abhishek Methuku

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 57

Top Topics

Computationally Challenging

Bipartite Graph

Algorithmic Aspects

Top Venues

Electron. J. Comb.

Comb. Probab. Comput.

Publications

Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan
Rainbow subdivisions of cliques. Random Struct. Algorithms 64 (3) (2024)
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang
Counting cliques in 1-planar graphs. Eur. J. Comb. 109 (2023)
Tao Jiang, Abhishek Methuku, Liana Yepremyan
Rainbow Turán number of clique subdivisions. Eur. J. Comb. 110 (2023)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
Turán problems for edge-ordered graphs. J. Comb. Theory, Ser. B 160 (2023)
Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons
-saturated graph. Discuss. Math. Graph Theory 43 (3) (2023)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins
On $3$-uniform hypergraphs avoiding a cycle of length four. Electron. J. Comb. 30 (4) (2023)
Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy
On the Turán Number of the Blow-Up of the Hexagon. SIAM J. Discret. Math. 36 (2) (2022)
Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Rainbow Ramsey Problems for the Boolean Lattice. Order 39 (3) (2022)
Abhishek Methuku, István Tomon
Bipartite Turán Problems for Ordered Graphs. Comb. 42 (6) (2022)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2022)
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29 (2) (2022)
Beka Ergemlidze, Abhishek Methuku
Triangles in C 5 -free graphs and hypergraphs of girth six. J. Graph Theory 99 (1) (2022)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288 (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
Graph and hypergraph colouring via nibble methods: A survey. CoRR (2021)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
The Exact Linear Turán Number of the Sail. Electron. J. Comb. 28 (4) (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2021)
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
Generalized Turán problems for even cycles. J. Comb. Theory, Ser. B 145 (2020)
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao
Set systems related to a house allocation problem. Discret. Math. 343 (7) (2020)
Dániel Gerbner, Abhishek Methuku, Cory Palmer
General lemmas for Berge-Turán hypergraph problems. Eur. J. Comb. 86 (2020)
Beka Ergemlidze, Tao Jiang, Abhishek Methuku
New bounds for a hypergraph bipartite Turán problem. J. Comb. Theory, Ser. A 176 (2020)
Ryan R. Martin, Abhishek Methuku, Andrew J. Uzzell, Shanise Walker
A Simple Proof for a Forbidden Subposet Problem. Electron. J. Comb. 27 (1) (2020)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. Comb. Probab. Comput. 29 (3) (2020)
Jürgen Kritschgau, Abhishek Methuku, Michael Tait, Craig Timmons
Few H copies in F -saturated graphs. J. Graph Theory 94 (3) (2020)
Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34 (1) (2020)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-Uniform Hypergraphs without a Cycle of Length Five. Electron. J. Comb. 27 (2) (2020)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Eur. J. Comb. 88 (2020)
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276 (2020)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. Comb. Probab. Comput. 29 (3) (2020)
Lucas Colucci, Ervin Györi, Abhishek Methuku
Edge colorings of graphs without monochromatic stars. Discret. Math. 343 (12) (2020)
Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait
Linearity of saturation for Berge hypergraphs. Eur. J. Comb. 78 (2019)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342 (11) (2019)
Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer
On the Weight of Berge-F-Free Hypergraphs. Electron. J. Comb. 26 (4) (2019)
Dániel Gerbner, Abhishek Methuku, Máté Vizer
. J. Comb. Theory, Ser. B 137 (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
On the Number of Containments in P-free Families. Graphs Comb. 35 (6) (2019)
Sean English, Pamela Gordon, Nathan Graber, Abhishek Methuku, Eric Sullivan
Saturation of Berge hypergraphs. Discret. Math. 342 (6) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Comb. Theory, Ser. A 163 (2019)
Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer
An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91 (1) (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Forbidding Rank-Preserving Copies of a Poset. Order 36 (3) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. Comb. Probab. Comput. 28 (2) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
On the Rainbow Turán number of paths. Electron. J. Comb. 26 (1) (2019)
Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90 (3) (2019)
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Máté Vizer
Stability Results for Vertex Turán Problems in Kneser Graphs. Electron. J. Comb. 26 (2) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-Uniform Hypergraphs and Linear Cycles. SIAM J. Discret. Math. 32 (2) (2018)
Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341 (9) (2018)
Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins
An Erdős-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69 (2018)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
An upper bound on the size of diamond-free families of sets. J. Comb. Theory, Ser. A 156 (2018)
Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
On the Turán number of some ordered even cycles. Eur. J. Comb. 73 (2018)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. Electron. J. Comb. 25 (2) (2018)
Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340 (5) (2017)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-uniform hypergraphs and linear cycles. Electron. Notes Discret. Math. 61 (2017)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia
-free graph. Electron. Notes Discret. Math. 61 (2017)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
-free graphs. Electron. Notes Discret. Math. 61 (2017)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Abhishek Methuku, Dömötör Pálvölgyi
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. Comb. Probab. Comput. 26 (4) (2017)
Dániel Gerbner, Abhishek Methuku, Casey Tompkins
Intersecting P-free families. J. Comb. Theory, Ser. A 151 (2017)
Dániel Grósz, Abhishek Methuku, Casey Tompkins
An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet. Order 34 (1) (2017)
Abhishek Methuku, Casey Tompkins
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle. Electron. J. Comb. 22 (4) (2015)