Lin-Peng Zhang

collaborators

2 papers

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.CO2020

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…