Yongxin Lan

collaborators

3 papers

math.CO2026

Improved Bounds for Unavoidable Claws in Tournaments

Jiangdong Ai, Yongxin Lan

Let $u (n)$ be the largest integer $d$ such that every $n$ -vertex claw with at most $d$ branches occurs in every tournament on $n$ vertices, and let $c_{\mathrm{claw}}=\limsup_{n\to…

math.CO2026

The planar TurÃ¡n number of ${K_{4}, I^_{6}^{i}}$

Jing Chen, Kai Gao, Yongxin Lan +2

Let $H$ be a family of graphs. A graph is said to be $H$ -free if it contains no subgraph isomorphic to a graph in $H$ . The planar TurÃ¡n number $ex_{_…

math.CO2026

The Outerplanar TurÃ¡n Number of Double Stars

Chaofan Zhang, Yongxin Lan, Changqing Xu

Let $H$ be a nonempty graph. A graph is $H$ -free if it does not contain any copy of $H$ as a subgraph. The outerplanar TurÃ¡n number of $H$ , denoted by $e x_{_{O P}} (n, H)$ , i…

Improved Bounds for Unavoidable Claws in Tournaments

The planar TurÃ¡n number of {K4​,I^6i​}

The Outerplanar TurÃ¡n Number of Double Stars

The planar TurÃ¡n number of ${K_{4}, I^_{6}^{i}}$