3 citations · 13 across the 24 of their papers we have counts for
6 papers · 1 filter
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…
Spanning trees in sparse expanders
Jie Han, Donglei Yang
Given integers , let be the collection of all -vertex trees with maximum degree at most . A question of Alon, Krivelevich and Sudakov in 2007…
-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 $…
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}:…
Balanced subdivisions of cliques in graphs
Bingyu Luan, Yantao Tang, Guanghui Wang +1
Given a graph , a balanced subdivision of is a graph obtained from by subdividing every edge the same number of times. In 1984, Thomassen conjectured that for each integ…
Clique-factors in graphs with sublinear -independence number
Jie Han, Ping Hu, Guanghui Wang +1
Given a graph and an integer , we denote by the maximum size of a -free subset of vertices in . A recent question of Nenadov and Pehova…