Jie Han

From MaRDI portal
Person:516072

Available identifiers

zbMath Open han.jieMaRDI QIDQ516072

List of research outcomes





PublicationDate of PublicationType
Transversal Hamilton cycle in hypergraph systems2025-01-22Paper
Spanning trees in graphs without large bipartite holes2024-11-05Paper
On powers of Hamilton cycles in Ramsey-Turán theory2024-10-22Paper
On some extremal results for order types2024-10-18Paper
\(H\)-factors in graphs with small independence number2024-10-08Paper
Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs2024-07-08Paper
The decision problem for perfect matchings in dense hypergraphs2024-06-24Paper
https://portal.mardi4nfdi.de/entity/Q61472522024-01-15Paper
A Ramsey–Turán theory for tilings in graphs2024-01-05Paper
Clique-factors in graphs with sublinear -independence number2023-11-08Paper
A robust version of the multipartite Hajnal--Szemer\'edi theorem2023-11-01Paper
The threshold for powers of tight Hamilton cycles in random hypergraphs2023-10-29Paper
On powers of tight Hamilton cycles in randomly perturbed hypergraphs2023-10-17Paper
Factors in randomly perturbed hypergraphs2023-10-12Paper
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs2023-10-12Paper
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu2023-10-11Paper
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs2023-10-05Paper
Finding any given 2‐factor in sparse pseudorandom graphs efficiently2023-09-29Paper
F$F$‐factors in Quasi‐random Hypergraphs2023-08-22Paper
An algorithmic version of the Hajnal--Szemer\'edi theorem2023-07-16Paper
On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory2023-05-27Paper
Zero-nonzero tree patterns that allow Sn∗2023-05-03Paper
Embedding clique-factors in graphs with low \(\ell\)-independence number2023-05-02Paper
Near-perfect clique-factors in sparse pseudorandom graphs2023-03-30Paper
Tiling multipartite hypergraphs in quasi-random hypergraphs2023-03-23Paper
Spanning trees in graphs without large bipartite holes2023-02-08Paper
Spanning trees in sparse expanders2022-11-09Paper
Finding matchings in dense hypergraphs2022-10-23Paper
Matching of Given Sizes in Hypergraphs2022-10-06Paper
$H$-factors in graphs with small independence number2022-07-06Paper
Turán number of disjoint triangles in 4-partite graphs2022-06-13Paper
Hamiltonicity in cherry-quasirandom 3-graphs2022-04-07Paper
Matchings in k‐partite k‐uniform hypergraphs2022-03-31Paper
On the Keevash-Knox-Mycroft Conjecture2022-02-08Paper
Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs2022-01-26Paper
Tiling multipartite hypergraphs in Quasi-random Hypergraphs2021-11-28Paper
Transversal Hamilton cycle in hypergraph systems2021-11-13Paper
The size-Ramsey number of 3-uniform tight paths2021-11-05Paper
On Perfect Matchings in k-Complexes2021-09-21Paper
Covering and tiling hypergraphs with tight cycles2021-06-15Paper
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs2021-02-02Paper
Finding Perfect Matchings in Dense Hypergraphs2021-02-02Paper
The multicolour size-Ramsey number of powers of paths2020-09-24Paper
The number of Gallai \(k\)-colorings of complete graphs2020-07-07Paper
Hamiltonicity in randomly perturbed hypergraphs2020-07-07Paper
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles2020-04-06Paper
Universality for bounded degree spanning trees in randomly perturbed graphs2020-02-14Paper
Powers of tight Hamilton cycles in randomly perturbed hypergraphs2020-02-14Paper
Property testing for point sets on the plane2020-02-12Paper
The complexity of perfect matchings and packings in dense hypergraphs2020-01-15Paper
Extremal and probabilistic results for order types2019-10-15Paper
Clique-factors in sparse pseudorandom graphs2019-08-30Paper
Finding any given 2-factor in sparse pseudorandom graphs efficiently2019-02-16Paper
Near-perfect clique-factors in sparse pseudorandom graphs2018-10-11Paper
On vertex-disjoint paths in regular graphs2018-05-25Paper
On Perfect Matchings and Tilings in Uniform Hypergraphs2018-04-27Paper
On hypergraphs without loose cycles2018-02-23Paper
Covering and tiling hypergraphs with tight cycles2018-01-18Paper
A degree version of the Hilton-Milner theorem2018-01-12Paper
Forbidden pairs and the existence of a spanning Halin subgraph2017-12-12Paper
Two-regular subgraphs of odd-uniform hypergraphs2017-11-28Paper
Exact Minimum Codegree Threshold for K4-Factors2017-10-27Paper
Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs2017-10-10Paper
Near Perfect Matchings ink-Uniform Hypergraphs2017-10-04Paper
The Complexity of Perfect Packings in Dense Graphs2017-05-19Paper
Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs2017-04-12Paper
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs2017-03-20Paper
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family2016-11-14Paper
Near Perfect Matchings in ${k}$-Uniform Hypergraphs II2016-08-04Paper
Forbidding Hamilton cycles in uniform hypergraphs2016-08-01Paper
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture2016-07-13Paper
Minimum Vertex Degree Threshold for ‐tiling*2015-07-23Paper
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs2015-06-22Paper
Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs2015-02-27Paper
On multipartite Hajnal-Szemerédi theorems2013-04-17Paper
Large $ Y_{3,2} $-tilings in 3-uniform hypergraphsN/APaper
Hamiltonicity of Sparse Pseudorandom GraphsN/APaper

Research outcomes over time

This page was built for person: Jie Han