Dingjia Mao

activity

20212026

collaborators

Showing 2024Show all

2 papers · 1 filter

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…