Alberto Espuny D'iaz

most citedLong running times for hypergraph bootstrap percolation

1 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022★ 1 cited

Long running times for hypergraph bootstrap percolation

Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1

Consider the hypergraph bootstrap percolation process in which, given a fixed $r$ -uniform hypergraph $H$ and starting with a given hypergraph $G_{0}$ , at each step we add to $G_{0}$ al…

math.CO2022★ 1 cited

Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph

Alberto Espuny Díaz, Joseph Hyde

Let $G$ be a graph obtained as the union of some $n$ -vertex graph $H_{n}$ with minimum degree $δ (H_{n}) \geq α n$ and a $d$ -dimensional random geometric graph $G^{d} (n, r)$ . We investigate u…

math.CO2021

Path decompositions of random directed graphs

Alberto Espuny Díaz, Viresh Patel, Fabian Stroh

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decompo…