Oscar Zamora

Orcid: 0000-0001-8335-7184

Affiliations:

University of Costa Rica, San José, Costa Rica
Central European University, Budapest, Hungary

According to our database¹, Oscar Zamora authored at least 18 papers between 2019 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Book free 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

2023

Turán numbers of Berge trees.

[BibT_eX]

[DOI]

Discret. Math., April, 2023

2022

The maximum number of paths of length three in a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

The maximum number of induced C 5 's in a planar graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Inverse Turán numbers.

[BibT_eX]

[DOI]

Discret. Math., 2022

The Turán number of the square of a path.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

The Turán number of the triangular pyramid of 3-layers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

The structure of hypergraphs without long Berge cycles.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2021

Connected hypergraphs without long Berge-paths.

[BibT_eX]

[DOI]

Ervin Györi

Nika Salia

Oscar Zamora

Eur. J. Comb., 2021

Saturation problems in the Ramsey theory of graphs, posets and point sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

A note on the Turán number of disjoint union of wheels.

[BibT_eX]

[DOI]

Chuanqi Xiao

Oscar Zamora

Discret. Math., 2021

The maximum number of paths of length four in a planar graph.

[BibT_eX]

[DOI]

Discret. Math., 2021

Generalized Planar Turán Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

The maximum Wiener index of maximal planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2019

An Erdős-Gallai type theorem for vertex colored graphs.

[BibT_eX]

[DOI]

Nika Salia

Casey Tompkins

Oscar Zamora

Graphs Comb., 2019

The maximum number of P<sub>ℓ</sub> copies in P<sub>k</sub>-free graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

Ramsey Numbers of Berge-Hypergraphs and Related Structures.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Oscar Zamora

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...