Chenyang Zhang

collaborators

3 papers

math.CO2026

An ErdÅs Matching Conjecture for Vector Spaces

Baoyan Feng, Chong Shangguan, Yulin Yang +1

We study a vector-space analogue of the ErdÅs Matching Conjecture. Let $m_{q} (n, k, s)$ denote the maximum cardinality of a family of $k$ -dimensional subspaces of an $n$ -dimensional v…

math.CO2026

Sharp asymptotic bounds for uniform union-free hypergraphs

Miao Liu, Chong Shangguan, Chenyang Zhang

An $r$ -uniform hypergraph is called $t$ -union-free if any two distinct subsets of at most $t$ edges have distinct union. The study of union-free hypergraphs has multiple origins an…

math.CO2024

Asymptotically sharp bounds for cancellative and union-free hypergraphs

Miao Liu, Chong Shangguan, Chenyang Zhang

An $r$ -graph is called $t$ -cancellative if for arbitrary $t + 2$ distinct edges $A_{1}, \dots, A_{t}, B, C$ , it holds that $(\cup_{i = 1}^{t} A_{i}) \cup B \neq = (\cup_{i = 1}^{t} A_{i}) \cup C$ ; it is cal…

An ErdÅs Matching Conjecture for Vector Spaces

Sharp asymptotic bounds for uniform union-free hypergraphs

Asymptotically sharp bounds for cancellative and union-free hypergraphs

An ErdÅs Matching Conjecture for Vector Spaces