Ramsey Numbers of Berge-Hypergraphs and Related Structures. - Nika Salia; Casey Tompkins; Zhiyu Wang; Oscar Zamora 001 (Electron. J. Comb., 2019)

The maximum number of Pℓ copies in Pk-free graphs. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math. Theor. Comput. Sci., 2019)

An Erdős-Gallai type theorem for vertex colored graphs. - Nika Salia; Casey Tompkins; Oscar Zamora 001 (Graphs Comb., 2019)

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)

The maximum Wiener index of maximal planar graphs. - Debarun Ghosh; Ervin Györi; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Comb. Optim., 2020)

Generalized Planar Turán Numbers. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Electron. J. Comb., 2021)

The maximum number of paths of length four in a planar graph. - Debarun Ghosh; Ervin Györi; Ryan R. Martin; Addisu Paulos; Nika Salia; Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2021)

A note on the Turán number of disjoint union of wheels. - Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2021)

Saturation problems in the Ramsey theory of graphs, posets and point sets. - Gábor Damásdi; Balázs Keszegh; David Malec; Casey Tompkins; Zhiyu Wang; Oscar Zamora 001 (Eur. J. Comb., 2021)

Connected hypergraphs without long Berge-paths. - Ervin Györi; Nika Salia; Oscar Zamora 001 (Eur. J. Comb., 2021)

The structure of hypergraphs without long Berge cycles. - Ervin Györi; Nathan Lemons; Nika Salia; Oscar Zamora 001 (J. Comb. Theory B, 2021)

The Turán number of the triangular pyramid of 3-layers. - Debarun Ghosh; Ervin Györi; Addisu Paulos; Chuanqi Xiao; Oscar Zamora 001 (Discret. Appl. Math., 2022)

The Turán number of the square of a path. - Chuanqi Xiao; Gyula O. H. Katona; Jimeng Xiao; Oscar Zamora 001 (Discret. Appl. Math., 2022)

Inverse Turán numbers. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2022)

The maximum number of induced C 5 's in a planar graph. - Debarun Ghosh; Ervin Györi; Oliver Janzer; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Graph Theory, 2022)

The maximum number of paths of length three in a planar graph. - Andrzej Grzesik; Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2022)

Turán numbers of Berge trees. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2023)

Book free 3-uniform hypergraphs. - Debarun Ghosh; Ervin Györi; Judit Nagy-György; Addisu Paulos; Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2024)

The maximum number of pentagons in a planar graph. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2025)