Xiaona Fang

collaborators

4 papers

math.CO2026

On the codegree TurÃ¡n density of projective geometries

Xiaona Fang, Yaojun Chen

Let $F$ be a $k$ -uniform hypergraph, abbreviated as $k$ -graph. The codegree TurÃ¡n density $I^^{3} (F)$ is the supremum over all $I^^{3} \in [0, 1)$ such that, for arbitrarily large $n$ , ther…

math.CO2026

On linear $k$ -graphs with codegree TurÃ¡n density arbitrarily close to zero

Xiaona Fang, Yaojun Chen

Let $F$ be a $k$ -uniform hypergraph, abbreviated as $k$ -graph. The codegree TurÃ¡n density $I ¨ _{co} (F)$ is the supremum over all $I^^{3} \in [0, 1)$ such that, for arbitrarily l…

math.CO2024

The TurÃ¡n number of path-star forests

Xiaona Fang, Yaojun Chen, Lihua You

The TurÃ¡n number of a graph $H$ , denoted by $e x (n, H)$ , is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. A linear (star) forest is a for…

math.CO2024

Generalized TurÃ¡n problem for a path and a clique

Xiaona Fang, Xiutao Zhu, Yaojun Chen

Let $H$ be a family of graphs. The generalized TurÃ¡n number $e x (n, K_{r}, H)$ is the maximum number of copies of the clique $K_{r}$ in any $n$ -vertex $H$ …

On the codegree TurÃ¡n density of projective geometries

On linear k-graphs with codegree TurÃ¡n density arbitrarily close to zero

The TurÃ¡n number of path-star forests

Generalized TurÃ¡n problem for a path and a clique

On linear $k$ -graphs with codegree TurÃ¡n density arbitrarily close to zero