3 citations · 6 across the 18 of their papers we have counts for
19 papers
Hypergraphs with irrational Turán density and many extremal configurations
Jianfeng Hou, Heng Li, Guanghui Wang +1
Unlike graphs, determining Turán densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of -uniform hyperg…
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…
Large -tilings in 3-uniform hypergraphs
Jie Han, Lin Sun, Guanghui Wang
Let be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph on vertices with at least $ \max \left \{ \binom{4αn}{3}, \binom{n…
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 $…