default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhishek Methuku
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j54]Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan:
Rainbow subdivisions of cliques. Random Struct. Algorithms 64(3): 625-644 (2024)- 2023
- [j53]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) - [j52]Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023) - [j51]J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku, Casey Tompkins, Xin Zhang:
Counting cliques in 1-planar graphs. Eur. J. Comb. 109: 103654 (2023) - [j50]Tao Jiang, Abhishek Methuku, Liana Yepremyan:
Rainbow Turán number of clique subdivisions. Eur. J. Comb. 110: 103675 (2023) - [j49]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 B 160: 66-113 (2023) - 2022
- [j48]Abhishek Methuku, István Tomon:
Bipartite Turán Problems for Ordered Graphs. Comb. 42(6): 895-911 (2022) - [j47]Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer:
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29(2) (2022) - [j46]Beka Ergemlidze, Abhishek Methuku:
Triangles in C 5 -free graphs and hypergraphs of girth six. J. Graph Theory 99(1): 26-39 (2022) - [j45]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): 453-463 (2022) - [j44]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): 1187-1199 (2022) - 2021
- [j43]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
The Exact Linear Turán Number of the Sail. Electron. J. Comb. 28(4) (2021) - [j42]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: 235-245 (2021) - [c1]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: 1080-1089 - [i2]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus:
Graph and hypergraph colouring via nibble methods: A survey. CoRR abs/2106.13733 (2021) - 2020
- [j41]Ryan R. Martin, Abhishek Methuku, Andrew J. Uzzell, Shanise Walker:
A Simple Proof for a Forbidden Subposet Problem. Electron. J. Comb. 27(1): 1 (2020) - [j40]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs without a Cycle of Length Five. Electron. J. Comb. 27(2): 2 (2020) - [j39]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): 423-435 (2020) - [j38]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): 436-454 (2020) - [j37]Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer:
On clique coverings of complete multipartite graphs. Discret. Appl. Math. 276: 19-23 (2020) - [j36]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): 111886 (2020) - [j35]Lucas Colucci, Ervin Györi, Abhishek Methuku:
Edge colorings of graphs without monochromatic stars. Discret. Math. 343(12): 112140 (2020) - [j34]Dániel Gerbner, Abhishek Methuku, Cory Palmer:
General lemmas for Berge-Turán hypergraph problems. Eur. J. Comb. 86: 103082 (2020) - [j33]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs. Eur. J. Comb. 88: 103109 (2020) - [j32]Beka Ergemlidze, Tao Jiang, Abhishek Methuku:
New bounds for a hypergraph bipartite Turán problem. J. Comb. Theory A 176: 105299 (2020) - [j31]Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for even cycles. J. Comb. Theory B 145: 169-213 (2020) - [j30]Jürgen Kritschgau, Abhishek Methuku, Michael Tait, Craig Timmons:
Few H copies in F -saturated graphs. J. Graph Theory 94(3): 320-348 (2020) - [j29]Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
Ramsey Problems for Berge Hypergraphs. SIAM J. Discret. Math. 34(1): 351-369 (2020)
2010 – 2019
- 2019
- [j28]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
On the Rainbow Turán number of paths. Electron. J. Comb. 26(1): 1 (2019) - [j27]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): 2 (2019) - [j26]Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer:
On the Weight of Berge-F-Free Hypergraphs. Electron. J. Comb. 26(4): 4 (2019) - [j25]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): 241-252 (2019) - [j24]Sean English, Pamela Gordon, Nathan Graber, Abhishek Methuku, Eric Sullivan:
Saturation of Berge hypergraphs. Discret. Math. 342(6): 1738-1761 (2019) - [j23]Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for disjoint copies of graphs. Discret. Math. 342(11): 3130-3141 (2019) - [j22]Sean English, Dániel Gerbner, Abhishek Methuku, Michael Tait:
Linearity of saturation for Berge hypergraphs. Eur. J. Comb. 78: 205-213 (2019) - [j21]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): 1519-1540 (2019) - [j20]Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Asymptotics for the Turán number of Berge-K2, t. J. Comb. Theory B 137: 264-290 (2019) - [j19]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Comb. Theory A 163: 163-181 (2019) - [j18]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): 227-230 (2019) - [j17]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): 88-97 (2019) - [j16]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): 611-620 (2019) - [i1]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 abs/1903.08383 (2019) - 2018
- [j15]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): 2 (2018) - [j14]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): 2602-2605 (2018) - [j13]Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins:
An Erdős-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69: 159-162 (2018) - [j12]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: 81-88 (2018) - [j11]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
An upper bound on the size of diamond-free families of sets. J. Comb. Theory A 156: 164-194 (2018) - [j10]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs and Linear Cycles. SIAM J. Discret. Math. 32(2): 933-950 (2018) - 2017
- [j9]Abhishek Methuku, Dömötör Pálvölgyi:
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. Comb. Probab. Comput. 26(4): 593-602 (2017) - [j8]Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins:
De Bruijn-Erdős-type theorems for graphs and posets. Discret. Math. 340(5): 995-999 (2017) - [j7]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-uniform hypergraphs and linear cycles. Electron. Notes Discret. Math. 61: 391-394 (2017) - [j6]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia:
A note on the maximum number of triangles in a C5-free graph. Electron. Notes Discret. Math. 61: 395-398 (2017) - [j5]Dániel Grósz, Abhishek Methuku, Casey Tompkins:
On subgraphs of C2k-free graphs. Electron. Notes Discret. Math. 61: 521-526 (2017) - [j4]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: 527-533 (2017) - [j3]Dániel Gerbner, Abhishek Methuku, Casey Tompkins:
Intersecting P-free families. J. Comb. Theory A 151: 61-83 (2017) - [j2]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): 113-125 (2017) - 2015
- [j1]Abhishek Methuku, Casey Tompkins:
Exact Forbidden Subposet Results using Chain Decompositions of the Cycle. Electron. J. Comb. 22(4): 4 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
