Dingjia Mao

activity

20212026

collaborators

6 papers

math.CO2026

Pancyclicity of graphs perturbed by a random $F$ -factor

Dingjia Mao, Feihong Yuan, Wenling Zhou

We determine the sharp minimum-degree threshold for Hamiltonicity in graphs perturbed by a uniformly random $K_{r}$ -factor, resolving a conjecture of Espuny Díaz and Girão [Random St…

math.CO2025

Hamilton cycles in regular graphs perturbed by a random 2-factor

Cicely, Henderson, Sean Longbrake +2

In this paper, we prove that for each $d \geq 2$ , the union of a $d$ -regular graph with a uniformly random $2$ -factor on the same vertex set is Hamiltonian with high probability. T…

math.CO2024

Regular bipartite decompositions of pseudorandom graphs

Asaf Ferber, Bryce Frederickson, Dingjia Mao +2

In 1972, Kotzig proved that for every even $n$ , the complete graph $K_{n}$ can be decomposed into $⌈ lo g_{2} n ⌉$ edge-disjoint regular bipartite spanning subgraphs, which is b…

math.CO2024

Hamiltonicity of Sparse Pseudorandom Graphs

Asaf Ferber, Jie Han, Dingjia Mao +1

We show that every $(n, d, λ)$ -graph contains a Hamilton cycle for sufficiently large $n$ , assuming that $d \geq lo g^{6} n$ and $λ \leq c d$ , where $c = \frac{1}{70000}$ . This significant…

math.CO2022

Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs

Asaf Ferber, Jie Han, Dingjia Mao

Given a family of graphs $G_{1}, \dots, G_{n}$ on the same vertex set $[n]$ , a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_{c}$ contributes exactly one edge. We…

math.CO2021

A stability result on matchings in 3-uniform hypergraphs

Mingyang Guo, Hongliang Lu, Dingjia Mao

Let $n, s, k$ be three positive integers such that $1 \leq s \leq (n - k + 1) / k$ and let $[n] = {1, \dots, n}$ . Let $H$ be a $k$ -graph with vertex set ${1, \dots, n}$ , and let $e (H)$ denote…