Yiting Wang

collaborators

5 papers

math.CO2026

On the number of distinct spanning trees in pseudorandom graphs

Yiting Wang

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_{n}$ is $I^\pm^{n}$ up to subexponential factors for an absolute constant $I^\pm > 0$ . In this note, we…

math.CO2026

Hitting time for Hamilton cycles in pseudorandom graphs

Yaobin Chen, Yu Chen, Seonghyuk Im +1

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence ${G_{t}}_{t = 0}^{∣ E (G) ∣}$ by taking a uniformly random ordering of the edges of $G…

math.CO2026

Note on the trace of random walks on pseudorandom graphs

Yaobin Chen, Yiting Wang

We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $ε > 0$ , there exists a constant $C$ such that the cover t…

math.CO2025

Approximate Itai-Zehavi conjecture for random graphs

Lawrence Hollom, Lyuben Lichev, Adva Mond +2

A famous conjecture by Itai and Zehavi states that, for every $d$ -vertex-connected graph $G$ and every vertex $r$ in $G$ , there are $d$ spanning trees of $G$ such that, for every v…

math.CO2025

Monotonicity and decompositions of random regular graphs

Lawrence Hollom, Lyuben Lichev, Adva Mond +2

In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameter…