Abhishek Methuku

Cituota

	Visi	Nuo 2020
Šaltiniai	961	739
h-rodyklė	20	17
i10-rodyklė	31	27

200

100

150

201520162017201820192020202120222023202420259 5 18 46 118 110 126 142 118 192 39

Viešas pasiekiamumas

Peržiūrėti viską

50 straipsnių

0 straipsnių

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Dániel GerbnerRényi InstitutePatvirtintas el. paštas renyi.hu
Ervin GyoriRenyi InstitutePatvirtintas el. paštas renyi.hu
Casey TompkinsAlfréd Rényi Institute of Mathematics, BudapestPatvirtintas el. paštas renyi.hu
Beka ErgemlidzeAlfréd Rényi Institute of MathematicsPatvirtintas el. paštas phd.ceu.edu
Daniela KuhnUniversity of BirminghamPatvirtintas el. paštas bham.ac.uk
Deryk OsthusUniversity of BirminghamPatvirtintas el. paštas bham.ac.uk
Dong Yeap KangExtremal Combinatorics and Probability Group, Institute for Basic SciencePatvirtintas el. paštas ibs.re.kr
Dániel T. NagyEötvös Loránd UniversityPatvirtintas el. paštas inf.elte.hu
Balázs PatkósRényi InstitutePatvirtintas el. paštas renyi.hu
Dömötör PálvölgyiEötvös Loránd University (ELTE)Patvirtintas el. paštas cs.elte.hu
Nika SaliaKing Fahd UniversityPatvirtintas el. paštas kfupm.edu.sa
Tom KellyGeorgia TechPatvirtintas el. paštas gatech.edu
Cory PalmerUniversity of MontanaPatvirtintas el. paštas umontana.edu
Oliver JanzerAssistant Professor, EPFLPatvirtintas el. paštas epfl.ch
Akbar DavoodiPatvirtintas el. paštas ipm.ir
Michael TaitVillanova UniversityPatvirtintas el. paštas villanova.edu
Sean EnglishUniversity of North Carolina WilmingtonPatvirtintas el. paštas uncw.edu
Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, BudapestPatvirtintas el. paštas renyi.hu
Craig TimmonsCalifornia State University SacramentoPatvirtintas el. paštas csus.edu
Istvan TomonProfessor of Mathematics, Umea UniversityPatvirtintas el. paštas umu.se

Stebėti

Abhishek Methuku

University of Illinois Urbana-Champaign

Patvirtintas el. paštas illinois.edu - Pagrindinis puslapis

Combinatorics


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
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	82	2020
General lemmas for Berge–Turán hypergraph problems D Gerbner, A Methuku, C Palmer European Journal of Combinatorics 86, 103082, 2020	53	2020
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	52	2019
Generalized Turán problems for disjoint copies of graphs D Gerbner, A Methuku, M Vizer Discrete Mathematics 342 (11), 3130-3141, 2019	45	2019
A note on the maximum number of triangles in a C₅‐free graph B Ergemlidze, A Methuku, N Salia, E Győri Journal of Graph Theory 90 (3), 227-230, 2019	42	2019
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	41	2017
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	40	2018
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	37	2019
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	31	2020
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	30*	2023
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	25	2020
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	24	2021
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	24	2017
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	23	2018
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	22	2023
Triangles in -free graphs and Hypergraphs of Girth Six B Ergemlidze, A Methuku arXiv preprint arXiv:1811.11873, 2018	22	2018
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	22	2018
On the Rainbow Tur\'an number of paths B Ergemlidze, E Győri, A Methuku arXiv preprint arXiv:1805.04180, 2018	22	2018
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	20	2022

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai