KrK_rKr-Packings in Graphs with tr−1(n)+kt_{r-1}(n)+ktr−1(n)+k Edgeswith Fuhong Ma, Jin Yan1 versionW_pt9qjz3kv1 · current
Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphsHanzhi Bai, J\orgen Bang-Jensen, Jin Yan0 citations2609.24463v12026arXiv
Packing and Covering Cycles Through Prescribed VerticesHanzhi Bai, Jin Yan0 citations2608.26772v12026arXiv
Hitting Maximum Independent Sets in Dense and Highly Connected GraphsHanzhi Bai, Yufei Chang, Jin Yan0 citations2608.18963v22026arXiv
Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete DigraphsHanzhi Bai, Jin Yan, Jia Zhou0 citations2608.17439v22026arXiv
Polynomial Algorithms for Minimum Degree Partitions in Semicomplete DigraphsHanzhi Bai, Jin Yan0 citations2607.02619v12026arXiv
New Tower-Type Lower Bounds for Hypergraph Ramsey NumbersHanzhi Bai, Longma Du, Xinyu Hu et al.0 citations2606.24198v12026arXiv