4 papers · 1 filter
The linear Turán number of the 3-graph
Chaoliang Tang, Hehui Wu, Junchi Zhang
We prove that for any linear 3-graph on vertices without a path of length 5, the number of edges is at most , and the equality holds if and only if the graph is…
Decomposition of Cliques into -Star-Forests
Jiaxi Nie, Yibo Ren, Hehui Wu
A -star-forest is a forest with at most connected components where each component is a star. Let be the minimum integer such that the complete graph on vertices…
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 : (1). …
1-subdivisions, fractional chromatic number and Hall ratio
Zdeněk Dvořák, Patrice Ossona de Mendez, Hehui Wu
The Hall ratio of a graph G is the maximum of |V(H)|/alpha(H) over all subgraphs H of G. Clearly, the Hall ratio of a graph is a lower bound for the fractional chromatic number. It…