Yiyang Zhan

collaborators

3 papers

math.CO2026

The second-order term for the largest $r$ -fork-free families

Yiyan Zhan, Mei Lu, Xiamiao Zhao

A family of subsets of $[n]$ is $r$ -fork-free if none of its members is strictly contained in $r$ other distinct members. For each fixed integer $r \geq 2$ , we prove that the maximum…

math.CO2026

Counting $t$ -wise $L$ -intersecting cliques with prescribed intersection sizes

Yiyan Zhan, Yichen Wang, Mei Lu

Let $r, t \geq 3$ be integers and $L = {ℓ_{1}, ℓ_{2}, \dots, ℓ_{s}} \subseteq [0, r - 1]$ a fixed set of integers with $∣ L ∣ \neq = r$ and $ℓ_{1} < ℓ_{2} < \dots < ℓ_{s}$ . For each integer $n$ …

math.CO2026

Extremal results on Berge disjoint paths

Xiamiao Zhao, Yiyan Zhan, Mei Lu

The well-known Erdős-Gallai Theorem gave the Turán number of paths. Bushaw and Kettle generalized this result to consider the Turán number of disjoint paths. Since then, many studi…

The second-order term for the largest r-fork-free families

Counting t-wise L-intersecting cliques with prescribed intersection sizes

Extremal results on Berge disjoint paths

The second-order term for the largest $r$ -fork-free families

Counting $t$ -wise $L$ -intersecting cliques with prescribed intersection sizes