Author

Shujie Chen

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

Extremal problems on disjoint path covers of graphs

In 1962, Erd\H{o}s characterized the maximum size of nonhamiltonian graphs of order $n$ with minimum degree at least $k$. Later, Ning and Peng [Combin. Probab. Comput. 29 (2020) 128-136] extended Erd\H{o}s's results to the clique condition and provided the maximum clique number for nonhamiltonian graphs of order $n$ wi...

Shujie Chen, Tao Tian · 0 citations