Arjun Ranganathan

collaborators

3 papers

math.CO2026

Packing subdivisions into regular graphs

Richard Montgomery, Kalina Petrova, Arjun Ranganathan +1

We show that, for any graph $F$ and $I^\cdot > 0$ , there exists a $d_{0} = d_{0} (F, I^\cdot)$ such that every $n$ -vertex $d$ -regular graph with $d \geq d_{0}$ has a collection of vertex-disjoint $F$ -su…

math.CO2025

Exact supported co-degree bounds for Hamilton cycles

Shoham Letzter, Arjun Ranganathan

For any $k \geq 3$ and $ℓ \in [k - 1]$ such that $(k, ℓ) \neq = (3, 1)$ , we show that any sufficiently large $k$ -graph $G$ must contain a Hamilton $ℓ$ -cycle provided that it has no…

math.CO2025

Relative TurÃ¡n densities for ordered graphs: all and nothing

Freddie Illingworth, Arjun Ranganathan, Leo Versteegen +1

Reiher, RÃ¶dl, Sales, and Schacht initiated the study of relative TurÃ¡n densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For…