Changlong Shen

collaborators

2 papers

math.CO2024

A Fan-type condition for cycles in $1$ -tough and $k$ -connected $(P_{2} \cup k P_{1})$ -free graphs

Zhiquan Hu, Jie Wang, Changlong Shen

For a graph $G$ , let $μ_{k} (G) := min {max_{x \in S} d_{G} (x) : S \in S_{k}}$ , where $S_{k}$ is the set consisting of all independent sets ${u_{1}, \dots, u_{k}}$ of $G$ suc…

math.CO2023

Erdős-Gyárfás Conjecture for $P_{10}$ -free Graphs

Zhiquan Hu, Changlong Shen

Let $P_{10}$ be a path on $10$ vertices. A graph is said to be $P_{10}$ -free if it does not contain $P_{10}$ as an induced subgraph. The well-known Erdős-Gyárfás Conjecture states…

A Fan-type condition for cycles in 1-tough and k-connected (P2​∪kP1​)-free graphs

Erdős-Gyárfás Conjecture for P10​-free Graphs

A Fan-type condition for cycles in $1$ -tough and $k$ -connected $(P_{2} \cup k P_{1})$ -free graphs

Erdős-Gyárfás Conjecture for $P_{10}$ -free Graphs