Yuanpei Wang

collaborators

6 papers

math.CO2026

Turán-good monotonicity thresholds

Yuanpei Wang, Liying Kang, Xiamiao Zhao

A graph $H$ is $K_{r + 1}$ -Turán-good if, for every sufficiently large $n$ , the Turán graph $T_{r} (n)$ maximizes the number of copies of $H$ among all $n$ -vertex $K_{r + 1}$ -free graphs.…

math.CO2026

The $(t, p)$ -Norm in Classical Extremal Problems

Xiamiao Zhao, Yuanpei Wang

Given integers $r > t \geq 1$ and a real number $p > 0$ , the $(t, p)$ -norm $∣∣ H ∣ ∣_{t, p}$ of an $r$ -graph $H$ is the sum of the $p$ -th powers of the degrees $d_{\mathcal…

math.CO2026

Counting even cycles and even paths with bounded circumference

Xiamiao Zhao, Yuanpei Wang

For an integer $L$ , write $C_{\geq L}$ for the family of cycles of length at least $L$ . For $L = 2 a$ let $H (n, L) = K_{a} + K_{n - a}$ , and for $L = 2 a + 1$ let $H (n, L)$ be obtained from…

math.CO2026

Counting Cycles in Graphs with Bounded Circumference

Xiamiao Zhao, Yuanpei Wang

For an integer $L \geq 2$ , let $a = ⌊ L /2 ⌋$ . Let $H (n, L)$ be the join of $K_{a}$ and an independent set of order $n - a$ , with one extra edge in the independent set when $L$ is…

math.CO2026

Strong Subgraph-Count Stability in $C_{2 ℓ + 1}$ -Free Graphs

Yuanpei Wang, Xiamiao Zhao

Starting from the stability theorem of Erdős and Simonovits, stability problems for graphs forbidding a fixed subgraph have been studied in terms of edge numbers, spectral radii an…

math.CO2026

Forbidding edge-critical graphs as trace in uniform hypergraphs

Yichen Wang, Xin Cheng, Ervin Győri +3

We say a hypergraph $H$ contains a graph $G$ as trace if there exists a vertex subset $S \subseteq V (H)$ such that $∣ S ∣ = V (G)$ and $\{e \cap S \mid e \in E(\ma…

Turán-good monotonicity thresholds

The (t,p)-Norm in Classical Extremal Problems

Counting even cycles and even paths with bounded circumference

Counting Cycles in Graphs with Bounded Circumference

Strong Subgraph-Count Stability in C2ℓ+1​-Free Graphs

Forbidding edge-critical graphs as trace in uniform hypergraphs

The $(t, p)$ -Norm in Classical Extremal Problems

Strong Subgraph-Count Stability in $C_{2 ℓ + 1}$ -Free Graphs