Lin-Peng Zhang

activity

20202026

most citedThe generalized Turán number of spanning linear forests

1 citations · 1 across the 9 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Spectral Extremal Graphs without a $K_{k}$ -Factor

Cunxiang Duan, Tingting Han, Lin-Peng Zhang

Let $k \geq 3$ and let $n = k m$ . A $K_{k}$ -factor in an $n$ -vertex graph is a collection of $m$ vertex-disjoint copies of $K_{k}$ that covers the entire vertex set. We determine the maximu…

math.CO2026

An Ore-type condition for $H$ -tilings in graphs

Yuping Gao, Yilin Guo, Guanghui Wang +1

A graph $G$ admits an $H$ -tiling if it contains a collection of vertex-disjoint copies of $H$ . In this paper, we confirm a conjecture proposed by Kühn, Osthus, and Treglown by show…

math.CO2026

Extremal Laplacian energy of $C_{k + 1}$ -free digraphs

Xiuwen Yang, Lin-Peng Zhang

The Laplacian energy of a digraph $G$ is defined as $\sum_{i = 1}^{n} λ_{i}^{2}$ , where $λ_{i}$ are the eigenvalues of the Laplacian matrix of $G$ . A (di)graph $G$ is said to be $H$ -free if…

Spectral Extremal Graphs without a Kk​-Factor

An Ore-type condition for H-tilings in graphs

Extremal Laplacian energy of Ck+1​​-free digraphs

Spectral Extremal Graphs without a $K_{k}$ -Factor

An Ore-type condition for $H$ -tilings in graphs

Extremal Laplacian energy of $C_{k + 1}$ -free digraphs