most citedFinding any given 2-factor in sparse pseudorandom graphs efficiently

4 citations · 4 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2026

Finding matchings in dense hypergraphs

Jie Han, Peter Keevash

We consider the algorithmic decision problem that takes as input an -vertex -uniform hypergraph with minimum codegree at least and decides whether it has a matching…

math.CO2026

A Ramsey-Turán theory for tilings in graphs

Jie Han, Patrick Morris, Guanghui Wang +1

For a -vertex graph and an -vertex graph , an -tiling in is a collection of vertex-disjoint copies of in . For , the -independence nu…

math.CO2026★ 4 cited

Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $φ\colon V(H)\to V…

math.CO2026

Clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

We prove that for any there exist constants and such that any -regular -vertex graph with and second largest eigenvalue in absolute…

math.CO2026

On the Keevash-Knox-Mycroft Conjecture

Luyining Gan, Jie Han

Given and , let be the decision problem for the existence of perfect matchings in -vertex -uniform hypergraphs with minimum $\…

math.CO2026

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…