Showing math.COShow all
2 papers · 1 filter
math.CO2026
On the number of factorable induced subgraphs
Jie Han, Bin Wang, Jingwen Zhao
Let be an -vertex graph. In this paper, we study the -factor problem in random induced subgraphs of dense graphs. We show that for any -vertex graph and , if…
math.CO2025
Perfect Matchings in Random Sparsifications of Dense Hypergraphs
Jie Han, Jingwen Zhao
Given \(1\le\ell <k \) and \(δ\geq 0\), let \(\mathbf{PM}(k,\ell,δ)\) be the decision problem for the existence of perfect matchings in \(n\)-vertex \(k\)-uniform hypergraphs with…