Peiru Kuang

collaborators

7 papers

math.CO2026

An Optimal Bound for Ramsey Goodness of Cycles

Peiru Kuang, Yan Wang

For graphs $F$ and $H$ , the Ramsey number $R (F, H)$ is the minimum integer $N$ such that every $N$ -vertex graph contains $F$ or its complement contains $H$ . If $F$ is connected and…

math.CO2026

An improved bound on the minimum size of Turán $(r + 1, r)$ -systems

Jun Gao, Peiru Kuang, Oleg Pikhurko +1

For positive integers $n \geq s > r$ , let $T (n, s, r)$ denote the minimum number of edges in an $r$ -uniform hypergraph on $n$ vertices such that every $s$ -set of vertices contains at lea…

math.CO2026

Covering the ternary cube by binary subcubes

Peiru Kuang, Yan Wang

For an integer $n \geq 0$ , let $f (n)$ be the minimum number of subcubes of $Z_{3}^{n}$ of the form $A_{1} \times \dots \times A_{n}$ , where $∣ A_{i} ∣ = 2$ for every $i$ , whose union covers…

math.NT2026

Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions

Peiru Kuang, Yan Wang

For a set $A \subseteq N_{0}$ , let $r_{1} (A, n)$ denote the number of solutions of the equation $a + a^{'} = n$ with $a, a^{'} \in A$ , and let $r_{2} (A, n)$ denote the number of…

math.CO2026

Proofs of Two Conjectures of Alon on Subgraph Counts

Peiru Kuang, Shuang Sun, Yan Wang +1

All graphs considered are finite with no isolated vertices. Let $N (m, H)$ be the maximum number of subgraphs of a graph $G$ isomorphic to $H$ , taken over all graphs $G$ with $m$ edg…

math.CO2026

Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications

Peiru Kuang, Yan Wang

An edge-colored graph is said to be rainbow if all its edges have distinct colors. In this paper, we study the rainbow analogue of a fundamental result of Mader [\emph{Math. Ann.}…

An Optimal Bound for Ramsey Goodness of Cycles

An improved bound on the minimum size of Turán (r+1,r)-systems

Covering the ternary cube by binary subcubes

Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions

Proofs of Two Conjectures of Alon on Subgraph Counts

Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications

An improved bound on the minimum size of Turán $(r + 1, r)$ -systems