Author

Zhan-Ping Yang

h-index 1 View on Semantic Scholar

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 Sep 2026

Bounds for Unions of Several Parts in Balanced Graph Partitions

Let $k\ge3$ and $1\le \ell\le k-1$. We study balanced $k$-partitions of a graph for which the union of any $\ell$ parts induces few edges. We show that every graph $G$ with $n$ vertices and $m$ edges admits a balanced partition $V_1,\ldots,V_k$ such that \begin{equation*} \max_{\substack{A\in\binom{[k]}{\ell}}}e_G\left...

Zhan-Ping Yang · 0 citations

Preprint Sep 2026

Intersections of Directed Graphs

Given two weighted directed graphs of order $n$, we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of their intersection is when they are placed at random. Bollob\'as and Scott studied these problems on weighted $k$-uniform hypergraphs and rai...

Zhan-Ping Yang, Qing-Hou Zeng · 0 citations

Preprint Aug 2026

Intersections of Oriented Graphs and Tournaments

Given two tournaments of order $n$, Bollob\'as and Scott defined their discrepancy as the largest deviation of their overlap from its random average under relabelling, and they asked whether the resulting discrepancy is always $\Omega (n^{3/2})$. We answer this question by proving that there is an absolute constant $c>...

Zhan-Ping Yang, Qingzhou Zeng · 1 citation · ⚡1