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

9 papers

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…

math.CO2025

Perfect tilings with the generalised triangle in $k$ -graphs

Weichan Liu, Xiangxiang Nie, Donglei Yang +1

Denote by $T_{k}$ the generalised triangle, a $k$ -uniform hypergraph on vertex set ${1, 2, \dots, 2 k - 1}$ with three edges ${1, \dots, k - 1, k}$ , ${1, \dots, k - 1, k + 1}$ and $\{k,k+1,\dots,…

math.CO2024

Connected Turán numbers for Berge paths in hypergraphs

Lin-Peng Zhang, Hajo Broersma, Ervin Győri +2

Let $F$ be a family of $r$ -uniform hypergraphs. Denote by $\ex^{\mathrm{conn}}_r(n,\mathcal{F})$ the maximum number of hyperedges in an $n$ -vertex connected $r$ -uniform h…

math.CO2024

A note on generalized crowns in linear r-graphs

Lin-Peng Zhang, Hajo Broersma, Ligong Wang

An $r$ -graph $H$ is a hypergraph consisting of a nonempty set of vertices $V$ and a collection of $r$ -element subsets of $V$ we refer to as the edges of $H$ . An $r$ -graph $H$ is ca…

math.CO2023

Turán numbers of general hypergraph star forests

Lin-Peng Zhang, Hajo Broersma, Ligong Wang

Let $F$ be a family of $r$ -uniform hypergraphs, and let $H$ be an $r$ -uniform hypergraph. Then $H$ is called $F$ -free if it does not contain any member of $\mat…

math.CO2022

Linear Turán numbers of acyclic quadruple systems

Lin-Peng Zhang, Ligong Wang

A linear $r$ -uniform hypergraph is called acycilc if it can be constructed starting from one single edge then at each step adding a new edge that intersect the union of the vertice…

math.CO2020★ 1 cited

The generalized Turán number of spanning linear forests

Lin-Peng Zhang, Ligong Wang, Jiale Zhou

Let $F$ be a family of graphs. A graph $G$ is called \textit{ $F$ -free} if for any $F \in F$ , there is no subgraph of $G$ isomorphic to $F$ . Given a gra…

Spectral Extremal Graphs without a Kk​-Factor

An Ore-type condition for H-tilings in graphs

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

Perfect tilings with the generalised triangle in k-graphs

Connected Turán numbers for Berge paths in hypergraphs

A note on generalized crowns in linear r-graphs

Turán numbers of general hypergraph star forests

Linear Turán numbers of acyclic quadruple systems

The generalized Turán number of spanning linear forests

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

Perfect tilings with the generalised triangle in $k$ -graphs