1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
The minimum positive uniform Turán density in uniformly dense -uniform hypergraphs
Hao Lin, Guanghui Wang, Wenling Zhou
A -graph (or -uniform hypergraph) is uniformly dense if the edge distribution of is uniformly dense with respect to every large collection of -vertex cliques induc…
Spanning trees in graphs without large bipartite holes
Jie Han, Jie Hu, Lidan Ping +3
We show that for any and , there exists such that for sufficiently large , every -vertex graph satisfying that $δ(G)\geq\varepsilon…
Rainbow Hamilton cycle in hypergraph system
Yucong Tang, Bin Wang, Guanghui Wang +1
In this paper, we develop a new rainbow Hamilton framework, which is of independent interest, settling the problem proposed by Gupta, Hamann, Müyesser, Parczyk, and Sgueglia when $…
-factors in graphs with small independence number
Ming Chen, Jie Han, Guanghui Wang +1
Let be an -vertex graph. The vertex arboricity of is the least integer such that can be partitioned into parts and each part induces a forest in $…
Decomposing edge-colored graphs under color degree constraints
Ruonan Li, Shinya Fujita, Guanghui Wang
For an edge-colored graph , the minimum color degree of means the minimum number of colors on edges which are adjacent to each vertex of . We prove that if is an edge…