Yu Chen

activity

20242026

collaborators

3 papers

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.CO2025

Robustness for expander graphs

Yaobin Chen, Yu Chen, Jie Han +1

We study robust versions of properties of $(n, d, I^»)$ -graphs, namely, the property of a random sparsification of an $(n, d, I^»)$ -graph, where each edge is retained with probability $p…

math.CO2024

On the thresholds of degenerate hypergraphs

Yu Chen, Jie Han, Haoran Luo

An $n$ -vertex $k$ -uniform hypergraph $G$ is $(d, I^\pm)$ -degenerate if $m_{1} (G) \leq d$ and there exists a constant $ε > 0$ such that for every subset $U \subseteq V (G)$ with si…