Tao Tian

collaborators

3 papers

math.CO2026

Spectral and size conditions for spanning k-trees in tough graphs

Siyuan Liang, Tao Tian

The toughness of a graph is a crucial parameter for characterizing its structural properties. The toughness of a non-complete graph $G$ is defined as $Ï(G) = \min \{ \dfrac{|S|}{c…

math.CO2026

ChvÃ¡tal-ErdÅs condition for 2-factors with at most two components in graphs

Tao Tian, Liming Xiong, Weigen Yan

It is well-known that ChvÃ¡tal and ErdÅs stated that any graph of order at least three whose independence number is no greater than its connectivity is Hamiltonian; that any graph…

math.CO2026

Every 3-connected ${K_{1, 4}, K_{1, 4} + e}$ -free split graph of order at least 13 is Hamilton-connected

Tao Tian, Fengming Dong

A graph $G$ is ${F_{1}, F_{2}, \dots, F_{k}}$ -free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1 \leq i \leq k)$ . A connected graph $G$ is a split graph if its v…

Spectral and size conditions for spanning k-trees in tough graphs

ChvÃ¡tal-ErdÅs condition for 2-factors with at most two components in graphs

Every 3-connected {K1,4​,K1,4​+e}-free split graph of order at least 13 is Hamilton-connected

ChvÃ¡tal-ErdÅs condition for 2-factors with at most two components in graphs

Every 3-connected ${K_{1, 4}, K_{1, 4} + e}$ -free split graph of order at least 13 is Hamilton-connected