Tianchi Yang

activity

20172021

C_{4}

-free graphs under degree constraints

3 citations · 4 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2021

Upper bounds on the extremal number of the 4-cycle

Jie Ma, Tianchi Yang

We obtain some new upper bounds on the maximum number $f (n)$ of edges in $n$ -vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound o…

math.CO2020★ 1 cited

Non-repeated cycle lengths and Sidon sequences

Jie Ma, Tianchi Yang

We prove a conjecture of Boros, Caro, Füredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a lon…

math.CO2019

Counting critical subgraphs in $k$ -critical graphs

Jie Ma, Tianchi Yang

Gallai asked in 1984 if any $k$ -critical graph on $n$ vertices contains at least $n$ distinct $(k - 1)$ -critical subgraphs. The answer is trivial for $k \leq 3$ . Improving a result of…

math.CO2017★ 3 cited

Decomposing $C_{4}$ -free graphs under degree constraints

Jie Ma, Tianchi Yang

A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least $s + t + 1$ can be partitioned into two parts which induce two subgraphs with minimum degree at lea…

Upper bounds on the extremal number of the 4-cycle

Non-repeated cycle lengths and Sidon sequences

Counting critical subgraphs in k-critical graphs

Decomposing C4​-free graphs under degree constraints

Counting critical subgraphs in $k$ -critical graphs

Decomposing $C_{4}$ -free graphs under degree constraints