Abhishek Methuku

Orcid: 0000-0002-5244-5365

According to our database1, Abhishek Methuku authored at least 54 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rainbow subdivisions of cliques.
Random Struct. Algorithms, May, 2024

2023
Turán problems for edge-ordered graphs.
J. Comb. Theory B, May, 2023

Rainbow Turán number of clique subdivisions.
Eur. J. Comb., May, 2023

Counting cliques in 1-planar graphs.
Eur. J. Comb., 2023

Minimizing the number of complete bipartite graphs in a K<sub>s</sub>-saturated graph.
Discuss. Math. Graph Theory, 2023

On $3$-uniform hypergraphs avoiding a cycle of length four.
Electron. J. Comb., 2023

2022
Rainbow Ramsey Problems for the Boolean Lattice.
Order, October, 2022

On the Turán Number of the Blow-Up of the Hexagon.
SIAM J. Discret. Math., 2022

Triangles in C 5 -free graphs and hypergraphs of girth six.
J. Graph Theory, 2022

Generalized Rainbow Turán Numbers.
Electron. J. Comb., 2022

Bipartite Turán Problems for Ordered Graphs.
Comb., 2022

2021
Adaptive majority problems for restricted query graphs and for weighted sets.
Discret. Appl. Math., 2021

Graph and hypergraph colouring via nibble methods: A survey.
CoRR, 2021

The Exact Linear Turán Number of the Sail.
Electron. J. Comb., 2021

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Ramsey Problems for Berge Hypergraphs.
SIAM J. Discret. Math., 2020

Few H copies in F -saturated graphs.
J. Graph Theory, 2020

Generalized Turán problems for even cycles.
J. Comb. Theory B, 2020

New bounds for a hypergraph bipartite Turán problem.
J. Comb. Theory A, 2020

General lemmas for Berge-Turán hypergraph problems.
Eur. J. Comb., 2020

Set systems related to a house allocation problem.
Discret. Math., 2020

Edge colorings of graphs without monochromatic stars.
Discret. Math., 2020

On clique coverings of complete multipartite graphs.
Discret. Appl. Math., 2020

On subgraphs of C2k-free graphs and a problem of Kühn and Osthus.
Comb. Probab. Comput., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.
Comb. Probab. Comput., 2020

A Simple Proof for a Forbidden Subposet Problem.
Electron. J. Comb., 2020

3-Uniform Hypergraphs without a Cycle of Length Five.
Electron. J. Comb., 2020

2019
Forbidding Rank-Preserving Copies of a Poset.
Order, 2019

An improvement on the maximum number of k?dominating independent sets.
J. Graph Theory, 2019

A note on the maximum number of triangles in a C5-free graph.
J. Graph Theory, 2019

Asymptotics for the Turán number of Berge-<i>K</i><sub>2, <i>t</i></sub>.
J. Comb. Theory B, 2019

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.
J. Comb. Theory A, 2019

On the Number of Containments in P-free Families.
Graphs Comb., 2019

Linearity of saturation for Berge hypergraphs.
Eur. J. Comb., 2019

Generalized Turán problems for disjoint copies of graphs.
Discret. Math., 2019

Saturation of Berge hypergraphs.
Discret. Math., 2019

Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.
Comb. Probab. Comput., 2019

Stability Results for Vertex Turán Problems in Kneser Graphs.
Electron. J. Comb., 2019

On the Rainbow Turán number of paths.
Electron. J. Comb., 2019

On the Weight of Berge-F-Free Hypergraphs.
Electron. J. Comb., 2019

2018
An upper bound on the size of diamond-free families of sets.
J. Comb. Theory A, 2018

On the Turán number of some ordered even cycles.
Eur. J. Comb., 2018

An Erdős-Gallai type theorem for uniform hypergraphs.
Eur. J. Comb., 2018

On the maximum size of connected hypergraphs without a path of given length.
Discret. Math., 2018

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.
Electron. J. Comb., 2018

2017
An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet.
Order, 2017

Intersecting P-free families.
J. Comb. Theory A, 2017

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs.
Electron. Notes Discret. Math., 2017

On subgraphs of C<sub>2k</sub>-free graphs.
Electron. Notes Discret. Math., 2017

A note on the maximum number of triangles in a C<sub>5</sub>-free graph.
Electron. Notes Discret. Math., 2017

3-uniform hypergraphs and linear cycles.
Electron. Notes Discret. Math., 2017

De Bruijn-Erdős-type theorems for graphs and posets.
Discret. Math., 2017

Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems.
Comb. Probab. Comput., 2017

2015
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle.
Electron. J. Comb., 2015


  Loading...