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 2024Show all

2 papers · 1 filter

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…