5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2025
Forcing Quasirandomness in a Regular Tournament
Jonathan A. Noel, Arjun Ranganathan, Lina M. Simbaqueba
A tournament is said to force quasirandomness if it has the property that a sequence 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 and an -uniform hypergraph , the -bootstrap process starts with an -uniform hypergraph and, in each time step, every hyperedge which "completes" a co…