Y. Mao

activity

20112026

most citedOn the generalized (edge-)connectivity of graphs

54 citations · 230 across the 74 of their papers we have counts for

collaborators

78 papers

math.NT2026

Gap spectra and densities of slow Fibonacci walks

Yaping Mao, Qinghong Zhao

Let $F_{1} = F_{2} = 1$ and $F_{t + 2} = F_{t + 1} + F_{t}$ for $t \geq 1$ . For every $n \geq 2$ , there are unique integers $a, b, t$ such that $n = a F_{t} + b F_{t - 1}$ with $t \geq 2$ and $1 \leq a \leq b \leq F_{t}$ .…

math.CO2026

Ramsey multiplicity for ordered graphs

Mengya He, Yaping Mao, Bing Wei +1

Let $\cG_1,\ldots,\cG_k$ be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number $\oR(\cG_1,\ldots,\cG_k)$ is the least integer $N$ such…

math.CO2026

The inversion number of a path-reversed tournament: Resolving a conjecture of Belkhechine, Bouaziz, Boudabbous, and Pouzet

Yaping Mao

Let $D$ be a tournament and let $X \subseteq V (D)$ . The inversion of $X$ reverses all arcs whose both endpoints lie in $X$ and leaves every other arc unchanged. A family of inversio…

math.CO2026

Multiplicity for partially ordered sets

Gyula O. H. Katona, Yaping Mao

Let $Q = {Q_{a} : a \geq 1}$ be a nested family of finite posets such that $Q_{a} \subseteq Q_{a + 1}$ and $∣ Q_{a} ∣ < ∣ Q_{a + 1} ∣$ . For a poset $Q$ , let $C_{t} (Q)$ denote the set of…

math.CO2026

Ramsey-Turán theory for partially-ordered sets

Gyula O. H. Katona, Yaping Mao

We introduce weak and strong poset Ramsey-Turán numbers for $t$ -chains in host poset families, focusing on the Boolean lattice family $B = {B_{n} : n \geq 1}$ . For any poset $P…

math.CO2026

From Halin's Edge Removability to Matching Removability in $k$ -Connected Graphs

Hengzhe Li, Mingming Zhou, Shinya Fujita +1

We study matching-removability under the degree/connectivity regime of Halin's theorem, which asserts that every $k$ -connected graph $G$ with minimum degree $δ (G) \geq k + 1$ contains…

Gap spectra and densities of slow Fibonacci walks

Ramsey multiplicity for ordered graphs

The inversion number of a path-reversed tournament: Resolving a conjecture of Belkhechine, Bouaziz, Boudabbous, and Pouzet

Multiplicity for partially ordered sets

Ramsey-Turán theory for partially-ordered sets

From Halin's Edge Removability to Matching Removability in k-Connected Graphs

From Halin's Edge Removability to Matching Removability in $k$ -Connected Graphs