Ji Zeng

activity

20242026

collaborators

Showing math.COShow all

16 papers · 1 filter

math.CO2026

Compactness of abundance in asymmetric hypergraph removal lemmas

Shuang Sun, Yan Wang, Yuyao Yang +1

Fix an integer $r \geq 2$ and a finite simple $r$ -uniform hypergraph $F$ with at least one edge and no isolated vertices. An $n$ -vertex $r$ -graph is $ε$ -far from being $F$ -free if at…

math.CO2026

Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic

Shuang Sun, Yuyao Yang, Jiasheng Zeng

Let $q$ be an odd prime power, and let $A_{n} = (a_{ij}) \in F_{q}^{n \times n}$ be a random matrix whose entries are independent and uniformly distributed on $F_{q}$ . The per…

math.CO2026

Every fork-free graph is perfectly weight divisible

Feng Liu, Shuang Sun, Yan Wang +2

A graph $G$ is \emph{perfectly weight divisible} if, for every positive integral weight function on $V (G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex…

math.CO2026

A Single-Exponential Erdős--Hajnal Bound for Graphs of Bounded VC-Dimension

Shuang Sun, Yan Wang, Jiasheng Zeng

A homogeneous set in a graph is a clique or a stable set. The Erdős--Hajnal conjecture states that, for every graph $H$ , there exists $c > 0$ such that every $H$ -free graph on $n$ ve…

math.CO2026

Finite-Kernel Extremizers in Sparse Extremal Graph Counting

Jiasheng Zeng

We develop a finite-kernel framework for sparse extremal graph counting. The problems considered here ask for the maximum number of copies or homomorphisms of a fixed graph under s…

math.CO2026

Proofs of Two Conjectures of Alon on Subgraph Counts

Peiru Kuang, Shuang Sun, Yan Wang +1

All graphs considered are finite with no isolated vertices. Let $N (m, H)$ be the maximum number of subgraphs of a graph $G$ isomorphic to $H$ , taken over all graphs $G$ with $m$ edg…