Exact Forbidden Subposet Results using Chain Decompositions of the Cycle. - Abhishek Methuku; Casey Tompkins (Electron. J. Comb., 2015)

Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. - Abhishek Methuku; Dömötör Pálvölgyi (Comb. Probab. Comput., 2017)

De Bruijn-Erdős-type theorems for graphs and posets. - Pierre Aboulker; Guillaume Lagarde; David Malec; Abhishek Methuku; Casey Tompkins (Discret. Math., 2017)

3-uniform hypergraphs and linear cycles. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. Notes Discret. Math., 2017)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia (Electron. Notes Discret. Math., 2017)

On subgraphs of C2k-free graphs. - Dániel Grósz; Abhishek Methuku; Casey Tompkins (Electron. Notes Discret. Math., 2017)

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. - Dániel Grósz; Abhishek Methuku; Casey Tompkins (Electron. Notes Discret. Math., 2017)

Intersecting P-free families. - Dániel Gerbner; Abhishek Methuku; Casey Tompkins (J. Comb. Theory A, 2017)

An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet. - Dániel Grósz; Abhishek Methuku; Casey Tompkins (Order, 2017)

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2018)

On the maximum size of connected hypergraphs without a path of given length. - Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Máté Vizer (Discret. Math., 2018)

An Erdős-Gallai type theorem for uniform hypergraphs. - Akbar Davoodi; Ervin Györi; Abhishek Methuku; Casey Tompkins (Eur. J. Comb., 2018)

On the Turán number of some ordered even cycles. - Ervin Györi; Dániel Korándi; Abhishek Methuku; István Tomon; Casey Tompkins; Máté Vizer (Eur. J. Comb., 2018)

An upper bound on the size of diamond-free families of sets. - Dániel Grósz; Abhishek Methuku; Casey Tompkins (J. Comb. Theory A, 2018)

On the Weight of Berge-F-Free Hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Cory Palmer (Electron. J. Comb., 2019)

On the Rainbow Turán number of paths. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2019)

Stability Results for Vertex Turán Problems in Kneser Graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Electron. J. Comb., 2019)

Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Comb. Probab. Comput., 2019)

Saturation of Berge hypergraphs. - Sean English; Pamela Gordon; Nathan Graber; Abhishek Methuku; Eric Sullivan (Discret. Math., 2019)

Generalized Turán problems for disjoint copies of graphs. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Math., 2019)

Linearity of saturation for Berge hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Michael Tait (Eur. J. Comb., 2019)

On the Number of Containments in P-free Families. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Graphs Comb., 2019)

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (J. Comb. Theory A, 2019)

Asymptotics for the Turán number of Berge-K2, t. - Dániel Gerbner; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2019)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Abhishek Methuku; Nika Salia; Ervin Györi (J. Graph Theory, 2019)

An improvement on the maximum number of k?dominating independent sets. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Balázs Patkós; Máté Vizer (J. Graph Theory, 2019)

Forbidding Rank-Preserving Copies of a Poset. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2019)

3-Uniform Hypergraphs without a Cycle of Length Five. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2020)

A Simple Proof for a Forbidden Subposet Problem. - Ryan R. Martin; Abhishek Methuku; Andrew J. Uzzell; Shanise Walker (Electron. J. Comb., 2020)

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Comb. Probab. Comput., 2020)

On subgraphs of C2k-free graphs and a problem of Kühn and Osthus. - Dániel Grósz; Abhishek Methuku; Casey Tompkins (Comb. Probab. Comput., 2020)

On clique coverings of complete multipartite graphs. - Akbar Davoodi; Dániel Gerbner; Abhishek Methuku; Máté Vizer (Discret. Appl. Math., 2020)

Edge colorings of graphs without monochromatic stars. - Lucas Colucci; Ervin Györi; Abhishek Methuku (Discret. Math., 2020)

Set systems related to a house allocation problem. - Dániel Gerbner; Balázs Keszegh; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Casey Tompkins; Chuanqi Xiao (Discret. Math., 2020)

General lemmas for Berge-Turán hypergraph problems. - Dániel Gerbner; Abhishek Methuku; Cory Palmer (Eur. J. Comb., 2020)

New bounds for a hypergraph bipartite Turán problem. - Beka Ergemlidze; Tao Jiang 003; Abhishek Methuku (J. Comb. Theory A, 2020)

Generalized Turán problems for even cycles. - Dániel Gerbner; Ervin Györi; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2020)

Few H copies in F -saturated graphs. - Jürgen Kritschgau; Abhishek Methuku; Michael Tait; Craig Timmons (J. Graph Theory, 2020)

Ramsey Problems for Berge Hypergraphs. - Dániel Gerbner; Abhishek Methuku; Gholam Reza Omidi; Máté Vizer (SIAM J. Discret. Math., 2020)

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (FOCS, 2021)

The Exact Linear Turán Number of the Sail. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2021)

Graph and hypergraph colouring via nibble methods: A survey. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (CoRR, 2021)

Adaptive majority problems for restricted query graphs and for weighted sets. - 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 (Discret. Appl. Math., 2021)

Bipartite Turán Problems for Ordered Graphs. - Abhishek Methuku; István Tomon (Comb., 2022)

Generalized Rainbow Turán Numbers. - Dániel Gerbner; Tamás Mészáros 001; Abhishek Methuku; Cory Palmer (Electron. J. Comb., 2022)

Triangles in C 5 -free graphs and hypergraphs of girth six. - Beka Ergemlidze; Abhishek Methuku (J. Graph Theory, 2022)

On the Turán Number of the Blow-Up of the Hexagon. - Oliver Janzer; Abhishek Methuku; Zoltán Lóránt Nagy (SIAM J. Discret. Math., 2022)

Rainbow Ramsey Problems for the Boolean Lattice. - Fei-Huang Chang; Dániel Gerbner; Wei-Tian Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2022)

On $3$-uniform hypergraphs avoiding a cycle of length four. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

Minimizing the number of complete bipartite graphs in a Ks-saturated graph. - Beka Ergemlidze; Abhishek Methuku; Michael Tait; Craig Timmons (Discuss. Math. Graph Theory, 2023)

Counting cliques in 1-planar graphs. - J. Pascal Gollin; Kevin Hendrey; Abhishek Methuku; Casey Tompkins; Xin Zhang (Eur. J. Comb., 2023)

Rainbow Turán number of clique subdivisions. - Tao Jiang 003; Abhishek Methuku; Liana Yepremyan (Eur. J. Comb., 2023)

Turán problems for edge-ordered graphs. - Dániel Gerbner; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Gábor Tardos; Máté Vizer (J. Comb. Theory B, 2023)

Cycles with many chords. - Nemanja Draganic; Abhishek Methuku; David Munhá Correia; Benny Sudakov (Random Struct. Algorithms, 2024)

Rainbow subdivisions of cliques. - Tao Jiang 003; Shoham Letzter; Abhishek Methuku; Liana Yepremyan (Random Struct. Algorithms, 2024)