10 papers
A Phase Transition for Small Dense Subhypergraphs
Peiru Kuang, Yan Wang
The local--global principle, which concerns the relationship between local structure and global parameters, has attracted considerable attention in extremal combinatorics over the…
An Optimal Bound for Ramsey Goodness of Cycles
Peiru Kuang, Yan Wang
For graphs and , the Ramsey number is the minimum integer such that every -vertex graph contains or its complement contains . If is connected and…
An improved bound on the minimum size of Turán -systems
Jun Gao, Peiru Kuang, Oleg Pikhurko +1
For positive integers , let denote the minimum number of edges in an -uniform hypergraph on vertices such that every -set of vertices contains at lea…
Covering the ternary cube by binary subcubes
Peiru Kuang, Yan Wang
For an integer , let be the minimum number of subcubes of of the form , where for every , whose union covers…
Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions
Peiru Kuang, Yan Wang
For a set , let denote the number of solutions of the equation with , and let denote the number of…
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 be the maximum number of subgraphs of a graph isomorphic to , taken over all graphs with edg…
Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture
Peiru Kuang, Feng Liu, Shuang Sun +2
Nikiforov conjectured that, for every fixed and all sufficiently large , the unique -vertex -free graph with maximum adjacency spectral radius is $S^+_{n,k}…
Induced subdivisions in graphs of large girth
Peiru Kuang, Yan Wang
In this paper, we prove that there exists an absolute constant such that, for every integer , every graph with and contains an induced s…
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.}…
Tight bounds for judicious 3-partitions of graphs
Peiru Kuang, Yan Wang
In this paper, we show that every graph with edges admits a 3-partition such that \[ \max_{1 \leq i \leq 3} e(V_i) \leq \frac{m}{9} + \frac{1}{9}h(m) \quad \text{and} \quad e(V…