9 papers
Transversal packings in families of percolated hypergraphs
Jie Han, Jie Hu, Shunan Wei +1
Let be a strictly -balanced -graph on vertices with edges and be the infimum of such that for every and sufficiently large $n\in \mathbb{N…
A robust version of the multipartite Hajnal--Szemerédi theorem
Jie Han, Jie Hu, Donglei Yang
In this note we show the following strengthening of a multipartite version of the Hajnal--Szemerédi theorem. For an integer and , there exists a constant such t…
A parameterized algorithm for -factors in graphs of high minimum degree
Luyining Gan, Jie Han, Jie Hu
A -factor of a graph is a collection of vertex-disjoint -cliques covering . We prove the following algorithmic version of the classical Hajnal--Szemerédi Theorem…
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…
Compatible Powers of Hamilton Cycles in Dense Graphs
Xiaohan Cheng, Jie Hu, Donglei Yang
Motivated by the concept of transition system investigated by Kotzig in 1968, Krivelevich, Lee and Sudakov proposed a more general notion of incompatibility system to formulate the…
Graph tilings in incompatibility systems
Jie Hu, Hao Li, Yue Wang +1
An \emph{incompatibility system} consists of a graph and a family over with $F_v\subseteq \{\{e,e'\}\in {E(G)\choose 2}:…
Crux and long cycles in graphs
John Haslegrave, Jie Hu, Jaehoon Kim +3
We introduce a notion of the \emph{crux} of a graph , measuring the order of a smallest dense subgraph in . This simple-looking notion leads to some generalisations of known…
Properly colored short cycles in edge-colored graphs
Laihao Ding, Jie Hu, Guanghui Wang +1
Properly colored cycles in edge-colored graphs are closely related to directed cycles in oriented graphs. As an analogy of the well-known Caccetta-Häggkvist Conjecture, we study th…
List strong edge-coloring of graphs with maximum degree 4
Baochen Zhang, Yulin Chang, Jie Hu +2
A strong edge-coloring of a graph is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…