H. Broersma

collaborators

4 papers

math.CO2025

Path Extendable Tournaments

Zan-Bo Zhang, Weihua He, Hajo Broersma +1

A digraph $D$ is called \emph{path extendable} if for every nonhamiltonian (directed) path $P$ in $D$ , there exists another path $P^{'}$ with the same initial and terminal verti…

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

Growth rates of the bipartite ErdÅs-GyÃ¡rfÃ¡s function

Xihe Li, Hajo Broersma, Ligong Wang

Given two graphs $G, H$ and a positive integer $q$ , an $(H, q)$ -coloring of $G$ is an edge-coloring of $G$ such that every copy of $H$ in $G$ receives at least $q$ distinct colors.…

Path Extendable Tournaments

Closures and heavy pairs for hamiltonicity

Connected TurÃ¡n numbers for Berge paths in hypergraphs

Growth rates of the bipartite ErdÅs-GyÃ¡rfÃ¡s function

Growth rates of the bipartite ErdÅs-GyÃ¡rfÃ¡s function