Jiangdong Ai

activity

20242026

collaborators

6 papers

math.CO2026

Maximizing the Steklov eigenvalues on trees with a diameter constraint

Jiangdong Ai, Huiqiu Lin, Yongtang Shi

We study the first nonzero Steklov eigenvalue $λ_{2} (T, δ Ω)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $δ Ω$ , under a constraint on the diameter $D$ .…

math.CO2026

Effect of edge-stretching on Steklov eigenvalues and sharp Steklov eigenvalue bounds on leaf--boundary trees

Jiangdong Ai, Yizhe Ji, Xiaopan Lian +1

Let $T$ be a finite tree with leaf set $\dO$ as the boundary and let $λ_{2}$ be the first nontrivial Steklov eigenvalue. Let $D$ and $ℓ$ be the maximum vertex degree and the numbe…

math.CO2026

Refinements of Alon-Babai-Suzuki-type intersection theorems via non-shadows and binomial support

Jiangdong Ai, Mingyu Liu

We prove a multilevel non-shadow refinement of the Alon--Babai--Suzuki (ABS) nonuniform restricted-intersection theorem. Let $K = {k_{1}, \dots, k_{r}}$ and let $L$ be a set with $∣ L ∣ = s$ …

math.CO2025

Strong Ramsey game on two boards

Jiangdong Ai, Jun Gao, Zixiang Xu +1

The strong Ramsey game $R (B, H)$ is a two-player game played on a graph $B$ , referred to as the board, with a target graph $H$ . In this game, two players, $P_{1}$ …

math.CO2024

Spanning weakly even trees of graphs

Jiangdong Ai, M. N. Ellingham, Zhipeng Gao +5

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$ . We say that $T$ is $even$ if every leaf of $T$ belongs to the same part of the bipartition o…

math.CO2024

A short note on spanning even trees

Jiangdong Ai, Zhipeng Gao, Xiangzhou Liu +1

We call a tree $T$ is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every $r$ -regular n…