Arjun Ranganathan

most citedOn the Running Time of Hypergraph Bootstrap Percolation

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Forcing Quasirandomness in a Regular Tournament

Jonathan A. Noel, Arjun Ranganathan, Lina M. Simbaqueba

A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_{n})_{n \in N}$ of tournaments of increasing orders is quasirandom if and only if…

math.CO2022★ 5 cited

On the Running Time of Hypergraph Bootstrap Percolation

Jonathan A. Noel, Arjun Ranganathan

Given $r \geq 2$ and an $r$ -uniform hypergraph $F$ , the $F$ -bootstrap process starts with an $r$ -uniform hypergraph $H$ and, in each time step, every hyperedge which "completes" a co…