Peiru Kuang

works on

expansion methods 1 graph coloring 1 graph cycles 1 ramsey numbers 1 ramsey theory 1

From the 1 of 8 linked papers with an AI index.

collaborators

8 papers

cs.IT2026

Resource-efficient Semantic Coding Schemes with Manifold-constrained Hyper-connections

Jingwen Fu, Ming Xiao

Semantic communication (SemCom) and task-oriented communication (TOC) can reduce wireless resource consumption by focusing on transmitting semantic or task-relevant information ins…

math.CO2026

An Optimal Bound for Ramsey Goodness of Cycles

Peiru Kuang, Yan Wang

The paper proves that for any nonempty graph H, the Ramsey number of a cycle C_n versus H satisfies R(C_n, H) = (χ(H)−1)(n−1)+σ(H) whenever n is at least a constant times |H|, conf…

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

Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture

Peiru Kuang, Feng Liu, Shuang Sun +2

Nikiforov conjectured that, for every fixed $k \geq 2$ and all sufficiently large $n$ , the unique $n$ -vertex $C_{2 k + 2}$ -free graph with maximum adjacency spectral radius is $S^+_{n,k}…

math.CO2026

Induced subdivisions in graphs of large girth

Peiru Kuang, Yan Wang

In this paper, we prove that there exists an absolute constant $g_{0}$ such that, for every integer $k \geq 3$ , every graph $G$ with $I^´ (G) \geq k$ and $g (G) \geq g_{0}$ contains an induced…