H. Broersma

activity

20072025

most citedOn a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees

5 citations · 15 across the 15 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Closures and heavy pairs for hamiltonicity

Wangyi Shang, Hajo Broersma, Shenggui Zhang +1

We say that a graph $G$ on $n$ vertices is ${H, F}$ - $o$ -heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least…

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…