Chen-Xiao Tian

collaborators

2 papers

math.CO2026

Alon's Question on Connectivity Graph-Codes: $f (d) = 2^{d}$ for Every $d \geq 4$

Chenxiao Tian

For a finite graph $H$ , a connectivity graph-code is a family $C \subseteq 2^{E (H)}$ such that $A △ B$ is a connected spanning subgraph of $H$ whenever $A$ and $B$ a…

math.CO2021

Union-closed Sets Conjecture Holds for Height No More Than 3 and Height No Less Than N-1

Chenxiao Tian

For each given union-closed family F of n elements and m sets, we discuss the union-closed sets conjecture from height number of the UC family, which is a natural parameter from la…

Alon's Question on Connectivity Graph-Codes: f(d)=2d for Every d≥4

Union-closed Sets Conjecture Holds for Height No More Than 3 and Height No Less Than N-1

Alon's Question on Connectivity Graph-Codes: $f (d) = 2^{d}$ for Every $d \geq 4$