Obserwuj
Abhishek Methuku
Abhishek Methuku
University of Illinois Urbana-Champaign
Zweryfikowany adres z illinois.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Generalized Turán problems for even cycles
D Gerbner, E Győri, A Methuku, M Vizer
Journal of Combinatorial Theory, Series B 145, 169-213, 2020
822020
General lemmas for Berge–Turán hypergraph problems
D Gerbner, A Methuku, C Palmer
European Journal of Combinatorics 86, 103082, 2020
532020
Asymptotics for the Turán number of Berge-K2, t
D Gerbner, A Methuku, M Vizer
Journal of Combinatorial Theory, Series B 137, 264-290, 2019
522019
Generalized Turán problems for disjoint copies of graphs
D Gerbner, A Methuku, M Vizer
Discrete Mathematics 342 (11), 3130-3141, 2019
472019
A note on the maximum number of triangles in a C5‐free graph
B Ergemlidze, A Methuku, N Salia, E Győri
Journal of Graph Theory 90 (3), 227-230, 2019
422019
Forbidden hypermatrices imply general bounds on induced forbidden subposet problems
A Methuku, D Pálvölgyi
Combinatorics, Probability and Computing 26 (4), 593-602, 2017
412017
An Erdős–Gallai type theorem for uniform hypergraphs
A Davoodi, E Győri, A Methuku, C Tompkins
European Journal of Combinatorics 69, 159-162, 2018
402018
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
B Ergemlidze, E Győri, A Methuku
Journal of Combinatorial Theory, Series A 163, 163-181, 2019
372019
A proof of the Erdős--Faber--Lovász conjecture
D Kang, T Kelly, D Kühn, A Methuku, D Osthus
Annals of Mathematics 198 (2), 537-618, 2023
33*2023
Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs
D Grósz, A Methuku, C Tompkins
European Journal of Combinatorics 88, 103109, 2020
312020
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
B Ergemlidze, E Győri, A Methuku, N Salia, C Tompkins, O Zamora
Combinatorics, Probability and Computing 29 (3), 423-435, 2020
252020
Graph and hypergraph colouring via nibble methods: A survey
DY Kang, T Kelly, D Kühn, A Methuku, D Osthus
arXiv preprint arXiv:2106.13733 21, 2021
242021
An improvement of the general bound on the largest family of subsets avoiding a subposet
D Grósz, A Methuku, C Tompkins
Order 34, 113-125, 2017
242017
On the Rainbow Tur\'an number of paths
B Ergemlidze, E Győri, A Methuku
arXiv preprint arXiv:1805.04180, 2018
232018
An upper bound on the size of diamond-free families of sets
D Grósz, A Methuku, C Tompkins
Journal of Combinatorial Theory, Series A 156, 164-194, 2018
232018
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
DY Kang, T Kelly, D Kühn, A Methuku, D Osthus
Transactions of the American Mathematical Society 376 (09), 6623-6662, 2023
222023
Triangles in -free graphs and Hypergraphs of Girth Six
B Ergemlidze, A Methuku
arXiv preprint arXiv:1811.11873, 2018
222018
On the maximum size of connected hypergraphs without a path of given length
E Győri, A Methuku, N Salia, C Tompkins, M Vizer
Discrete Mathematics 341 (9), 2602-2605, 2018
222018
Turán problems for edge-ordered graphs
D Gerbner, A Methuku, DT Nagy, D Pálvölgyi, G Tardos, M Vizer
Journal of Combinatorial Theory, Series B 160, 66-113, 2023
20*2023
Generalized rainbow Turán numbers
D Gerbner, A Methuku, T Meszaros, C Palmer
The Electronic Journal of Combinatorics 29, 2022
202022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20