graph factors 1hypergraph matchings 1minimum degree conditions 1probabilistic combinatorics 1random induced subgraphs 1
From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
On the number of factorable induced subgraphs
Jie Han, Bin Wang, Jingwen Zhao
The paper studies when random induced subgraphs of dense graphs contain a perfect packing (F‑factor) of a fixed small graph F, showing that under a minimum‑degree condition the pro…
math.CO2025
Robustness for expander graphs
Yaobin Chen, Yu Chen, Jie Han +1
We study robust versions of properties of -graphs, namely, the property of a random sparsification of an -graph, where each edge is retained with probability $p…
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 wit…