Jiangdong Ai

collaborators

2 papers

math.CO2026

On a weaker notion of cross $t$ -intersecting families

Jiangdong Ai, Ming Chen, Seokbeom Kim +1

We prove that if two families $F \subseteq (k [ n ])$ and $F^{'} \subseteq (k ^{'} [ n ])$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert…

math.CO2025

On high discrepancy $1$ -factorizations of complete graphs

Jiangdong Ai, Fankang He, Seonghyuk Im +1

We proved that for every sufficiently large $n$ , the complete graph $K_{2 n}$ with an arbitrary edge signing $I ¨ : E (K_{2 n}) \to {- 1, + 1}$ admits a high discrepancy $1$ -factor deco…

On a weaker notion of cross t-intersecting families

On high discrepancy 1-factorizations of complete graphs

On a weaker notion of cross $t$ -intersecting families

On high discrepancy $1$ -factorizations of complete graphs