Tao Fang

activity

20222024

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2024

The planar Turán number of ${K_{4}, Θ_{5}}$

Tao Fang

Let $F$ be a set of graphs. The planar Turán number, $e x_{P} (n, F)$ , is the maximum number of edges in an $n$ -vertex planar graph which does not contai…

math.CO2023

Turán problems for linear forests and cliques

Tao Fang

Given a graph $T$ and a family of graphs $H$ . The generalized Turán number of $H$ is the maximum number of copies of $T$ in an $H$ -free graph on $n$ v…

math.CO2022

Some results on the Turán number of $k_{1} P_{ℓ} \cup k_{2} S_{ℓ - 1}$

Tao Fang, Xiying Yuan

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. Let $P_{ℓ}$ denote the path…

math.CO2022

The Turán number of $k_{1} P_{2 l} \cup k_{2} S_{2 l - 1}$

Tao Fang, Xiying Yuan

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. Let $P_{k}$ denote the path on $k…

math.CO2022

Extremal graphs for odd-ballooning of paths and stars

Tao Fang, Xiying Yuan

The odd-ballooning of a graph $G$ , denoted by $G_{q}$ , is the graph obtained from replacing each edge in $G$ by a odd cycle of the same size where the new vertices of the odd cycles…

The planar Turán number of {K4​,Θ5​}

Turán problems for linear forests and cliques

Some results on the Turán number of k1​Pℓ​∪k2​Sℓ−1​

The Turán number of k1​P2l​∪k2​S2l−1​

Extremal graphs for odd-ballooning of paths and stars

The planar Turán number of ${K_{4}, Θ_{5}}$

Some results on the Turán number of $k_{1} P_{ℓ} \cup k_{2} S_{ℓ - 1}$

The Turán number of $k_{1} P_{2 l} \cup k_{2} S_{2 l - 1}$