Zijian Deng

collaborators

2 papers

math.CO2026

A sharp density bound for 5-connected graphs with no $\Ke$ minor

Caibing Chang, Zijian Deng, Qinfei Tang +1

Let $\Ke$ be obtained from $K_{7}$ by deleting two independent edges. We prove that every 5-connected graph on $n \geq 7$ vertices with at least $4 n - 9$ edges contains a $\Ke$ minor, set…

math.CO2026

Layer barriers for colour-biased tight Hamilton cycles

Zijian Deng, Qinfei Tang, Caihong Yang

We construct a family of layer barriers for colour-biased tight Hamilton cycles in uniform hypergraphs. For every $k \geq 3$ and every $a \in {0, \dots, k - 1}$ , we give a red--blue col…