Jane Tan

collaborators

3 papers

math.CO2025

Packing subdivisions into regular graphs

Richard Montgomery, Kalina Petrova, Arjun Ranganathan +1

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

math.CO2025

A local limit theorem for the edge counts of random induced subgraphs of a random graph

Paul Balister, Emil Powierski, Alex Scott +1

Consider a `dense' Erdős--Rényi random graph model $G = G_{n, M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M / (2 n)$ is bounded away from 0 and 1. Fix…

math.CO2025

Tight Bounds for Hypercube Minor-Universality

Emma Hogan, Lukas Michel, Alex Scott +3

Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant $c > 0$ such that any graph with at most $c \cdot 2^{d} / d$ edges and no isolated vertices is a minor of th…