Oscar Zamora

activity

20172024

most citedThe Maximum Number of Pentagons in a Planar Graph

7 citations · 21 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

The Structure of Hypergraphs without long Berge cycles

Ervin Győri, Nathan Lemons, Nika Salia +1

We study the structure of $r$ -uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \leq r$ , and determine that such hypergraphs have some special substructu…

math.CO2018

Ramsey numbers of Berge-hypergraphs and related structures

Nika Salia, Casey Tompkins, Zhiyu Wang +1

For a graph $G = (V, E)$ , a hypergraph $H$ is called a Berge- $G$ , denoted by $B G$ , if there exists a bijection $f : E (G) \to E (H)$ such that for every $e \in E (G)$ ,…

math.CO2018★ 6 cited

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs

Ervin Győri, Nika Salia, Casey Tompkins +1

Generalizing Turán's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$ -free graph, for a pair of graphs $T$ …

The Structure of Hypergraphs without long Berge cycles

Ramsey numbers of Berge-hypergraphs and related structures

The maximum number of Pℓ​ copies in Pk​-free graphs

The maximum number of $P_{ℓ}$ copies in $P_{k}$ -free graphs