Zhifei Yan

activity

20242026

collaborators

9 papers

math.CO2026

Tight Staircase Bounds for Cyclic Subsets below Dirac's Threshold

Hong Liu, Mengyuan Niu, Lanchao Wang +1

Let $Cyc (G)$ denote the number of cyclic subsets in a graph $G$ , which are subsets that induce a Hamiltonian subgraph. DraganiÄ, Keevash and MÃ¼yesser recently prov…

math.CO2026

The sharp threshold for rainbow stackings of random edge-colourings

Hong Liu, Guorui Ma, Yangrui Xiang +1

A rainbow stacking of $m$ independent, uniformly random $r$ -edge-colourings of $K_{n}$ is a tuple of vertex permutations that superimposes the colourings such that no two edges of th…

math.CO2026

Constructor--Blocker games forbidding even cycles

Lanchao Wang, Zhifei Yan

The Constructor--Blocker game is played on the edge set of $K_{n}$ . Two players alternately claim previously unclaimed edges. Constructor aims to maximize the number of copies of a t…

math.CO2026

Triangle packings in randomly perturbed graphs

Xinbu Cheng, Hong Liu, Lanchao Wang +1

The longstanding Nash-Williams conjecture asserts that every $K_{3}$ -divisible graph $G$ with $I^´ (G) \geq 3 n /4$ admits a triangle decomposition. In the random setting, Frankl and RÃ¶dl…

math.CO2026

Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs

Guorui Ma, Zhifei Yan

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $I^\pm = I^\pm (n) = o (1)$ , let $G_{I^} \pm$ be an $n$ -vertex graph with minimum degree $Î´(G_Î±)\g…

math.CO2026

Ramsey properties for tilings in random graphs

Lucas AragÃ£o, Xinbu Cheng, Rafael Filipe +3

Let $m H$ be the graph formed by $m$ vertex-disjoint copies of a graph $H$ . Let $G \to (H)_{r}$ denote that, in any $r$ -colouring of the edges of $G$ , there exists a monochromatic cop…