Hehui Wu

collaborators

3 papers

math.CO2026

Bisections of graphs under degree constraints

Jie Ma, Hehui Wu

In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$ : (1). $G$ …

math.CO2026

The linear TurÃ¡n number of the 3-graph $P_{5}$

Chaoliang Tang, Hehui Wu, Junchi Zhang

We prove that for any linear 3-graph on $n$ vertices without a path of length 5, the number of edges is at most $\frac{15}{11} n$ , and the equality holds if and only if the graph is…

math.CO2025

Decomposition of Cliques into $k$ -Star-Forests

Jiaxi Nie, Yibo Ren, Hehui Wu

A $k$ -star-forest is a forest with at most $k$ connected components where each component is a star. Let $F_{k} (n)$ be the minimum integer such that the complete graph on $n$ vertices…

Bisections of graphs under degree constraints

The linear TurÃ¡n number of the 3-graph P5​

Decomposition of Cliques into k-Star-Forests

The linear TurÃ¡n number of the 3-graph $P_{5}$

Decomposition of Cliques into $k$ -Star-Forests