Fan Yang

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Balanced clique subdivisions and cycles lengths in $K_{s, t}$ -free graphs

Jianfeng Hou, Yindong Jin, Donglei Yang +1

Let $t \geq s \geq 2$ be integers. Confirming a conjecture of Mader, Liu and Montgomery [J. Lond. Math. Soc., 2017] showed that every $K_{s, t}$ -free graph with average degree $d$ cont…

math.CO2025

Large cliques in graphs with forbidden semi-induced structures

Nannan Chen, Yulai Ma, Fan Yang

In 2022, Holmsen showed that any graph with at least $ c \binom{n}{r} $ $r$-cliques but no induced complete $r$ -partite graph $K_{2, \dots, 2}$ must contain a clique of order \…

math.CO2025

Extremal density for subdivisions with length or sparsity constraints

Jaehoon Kim, Hong Liu, Yantao Tang +3

Given a graph $H$ , a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any g…

math.CO2024

Topological cliques in sparse expanders

Xia Wang, Donglei Yang, Fan Yang +1

In the paper, we focus on embedding clique immersions and subdivisions within sparse expanders, and we derive the following main results: (1) For any $0 < I^\cdot < 1/2$ , there exists $K>…

math.CO2024

Embedding clique subdivisions via crux

Donglei Yang, Fan Yang

For a graph $G$ and a constant $I^\pm > 0$ , we denote by $C_{I^} \pm (G)$ the minimum order of a subgraph $H \subseteq G$ with $d (H) \geq I^\pm d (G)$ . Liu and Montgomery conjectured that every graph…

Balanced clique subdivisions and cycles lengths in Ks,t​-free graphs

Large cliques in graphs with forbidden semi-induced structures

Extremal density for subdivisions with length or sparsity constraints

Topological cliques in sparse expanders

Embedding clique subdivisions via crux

Balanced clique subdivisions and cycles lengths in $K_{s, t}$ -free graphs