Xiamiao Zhao

activity

20242026

collaborators

27 papers

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

A stability theorem for Berge Hamiltonian cycles under a minimum degree condition

Yichen Wang, Dániel Gerbner, Xiamiao Zhao

In this paper, we study extremal and stability problems for Berge Hamiltonian cycles in $r$ -uniform hypergraphs under a minimum degree condition. Let $ g_r(n,t)=\binom{n-t}{r}+t\bi…

math.CO2026

Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs

Mengyu Cao, Mei Lu, Xiamiao Zhao

Let $G$ be a connected simple vertex-transitive graph on $n$ vertices with degree $d$ , and let $G_{p}$ be the random spanning subgraph obtained by retaining each edge of $G$ independ…

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

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

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 a…

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

A stability theorem for Berge Hamiltonian cycles under a minimum degree condition

Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs

Counting Cycles in Graphs with Bounded Circumference

Counting even cycles and even paths with bounded circumference

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

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

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