Skip to content

Author

Run-Han Zhao

We have 3 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Sharp bounds for Duke--Erd\H{o}s--R\"odl problems on cycle-connected subgraphs

For $k\ge2$, a graph is $C_{2k}$-connected if every two distinct edges lie together on an even cycle of length at most $2k$ in that graph. Let $f_k(n,m)$ be the largest number of edges in a $C_{2k}$-connected subgraph that every $n$-vertex graph with $m$ edges must contain. In this paper, we study two cycle-connected p...

Guo-Rong Gao, Run-Han Zhao · 0 citations
Open access Aug 2026

A three-party verifiable blind quantum computing protocol with separated input and function ownership

Blind quantum computing enables quantum-limited clients to securely access untrusted quantum servers. This paper proposes a three-party verifiable blind quantum computing protocol with separated input and function ownership, where Alice holds the private input, Bob holds the target function, and Charlie performs the de...

Yun-Hao Feng, Rigui Zhou, Ran Guo et al. · 0 citations
Preprint Jul 2026

Tight bound for the skew Hamming set-pair problem

Let $X$ be an alphabet, let $t\geq 0$ and $n\geq t+1$, and let $((a_i,b_i))_{i=1}^{m}$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\geq t+1$ for every $i$ and $dist(a_i,b_j)\leq t$ whenever $i<j$. We prove the sharp bound $m\leq 2^{t+1}$, thereby resolving a problem posed by Alon, Jin, and Suda...

Guo-Rong Gao, Run-Han Zhao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.