Yan Wang

collaborators

9 papers

math.CO2026

The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges

Levente Bodnár, Oleg Pikhurko, Shumin Sun +2

The famous and actively studied problem of Brown--Erdős--Sós from 1973 asks for $f^{(r)} (n; s, k)$ , the maximum number of edges in an $r$ -graph with $n$ vertices in which no $s$ vert…

math.CO2026

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…

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

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.}…

math.CO2025

Tight bounds for judicious 3-partitions of graphs

Peiru Kuang, Yan Wang

In this paper, we show that every graph with $m$ 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…

math.CO2025

Consecutive and quasi-consecutive patterns: $des$ -Wilf classifications and generating functions

Yan Wang, Qi Fang, Shishuo Fu +2

Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as e…

The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges

A Phase Transition for Small Dense Subhypergraphs

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

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

Tight bounds for judicious 3-partitions of graphs

Consecutive and quasi-consecutive patterns: des-Wilf classifications and generating functions

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

Consecutive and quasi-consecutive patterns: $des$ -Wilf classifications and generating functions